Machine scheduling problems arise in many production processes, and are something that needs to be consider when optimizing the supply chain. Among them, flowshop happen a number of jobs have sequentially processed by machines. This paper addressees, for first time, Permutation Flowshop Scheduling problem with additional Resources during Setups (PFSR-S). In this problem, addition standard permu...

This paper is the first to consider the hybrid quantum-inspired evolutionary algorithm (HQEA) on the no-wait permutation flow shop scheduling problem (PFSP) for minimizing the makespan. In this HQEA, the quantum chromosomes are encoded by using the quantum rotating angle and a simple but efficient converting mechanism for determining job sequence is proposed for the representation of solution f...

The flowshop problem (FSP) is one of the most thoroughly studied scheduling problems. In the FSP, a set N = {1, . . . , n} of n independent jobs has to be processed on a set M = {1, . . . ,m} of m machines. Every job j, j ∈ N , requires a given fixed, non-negative processing time pij on every machine i, i ∈ M . In a flowshop, all n jobs are to be processed on the m machines in the same order, t...

The paper considers the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines at the first stage and a single machine at the second stage. At the first stage, jobs use some additional renewable resources which are available in limited quantities. The resource requirements are of 0-1 type. The objective is minimization of the makespan. The problem is NP-hard. ...

This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. Initially, a job scheduling algorithm that obtains an optimal schedule for a given job sequence is presented. This algorithm is used with a job insertion procedure to generate a group of heuristics that differ on the initial job sequencing rule. Computational...

The production of bakery goods is strictly time sensitive due to the complex biochemical processes during dough fermentation, which leads to special requirements for production planning and scheduling. Instead of mathematical methods scheduling is often completely based on the practical experience of the responsible employees in bakeries. This sometimes inconsiderate scheduling approach often l...