Tabu search for total tardiness minimization in flowshop scheduling problems
Computers and Operations Research
Two-Machine No-Wait Flow Shop Scheduling with Missing Operation
Mathematics of Operations Research
3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints
Information Processing Letters
Information Processing Letters
Computers and Operations Research
Design and Analysis of Experiments
Design and Analysis of Experiments
Computers and Operations Research
Considering scheduling and preventive maintenance in the flowshop sequencing problem
Computers and Operations Research
An improved NEH heuristic to minimize makespan in permutation flow shops
Computers and Operations Research
Operations Research Letters
Setting a common due date in a constrained flowshop: A variable neighbourhood search approach
Computers and Operations Research
| Hi-index | 0.01 |
In this paper, we address the problem of scheduling a set of jobs in a flowshop with makespan objective. In contrast to the usual assumption of machine availability presented in most research, we consider that machines may not be available at the beginning of the planning period, due to processing of previously scheduled jobs. We first formulate the problem, analyse the structure of solutions depending on a number of factors (such as machines, jobs, structure of the processing times, availability vectors, etc.), and compare it with its classical counterpart. Results indicate that the problem under consideration presents a different structure of solutions, and that it is easier than the classical permutation flowshop problem. In view of these results, we propose and test a number of fast heuristics for the problem.