BPSS: a scheduling support system for the packaging industry
Operations Research
Computers and Industrial Engineering
Hybrid flow shop scheduling: a survey
Computers and Industrial Engineering
Preemptive scheduling with changeovers: using column generation technique and genetic algorithm
Computers and Industrial Engineering
Heuristic algorithms for the two-stage hybrid flowshop problem
Operations Research Letters
Computers and Industrial Engineering
| Hi-index | 0.00 |
This paper deals with 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 resources which are available in limited quantities at any time. The resource requirements are of 0-1 type. The objective is the minimization of makespan. The problem is NP-hard. Heuristic algorithms are proposed which solve to optimality the resource constrained scheduling problem at the first stage of the flowshop, and at the same time, minimize the makespan in the flowshop by selecting appropriate jobs for simultaneous processing. Several rules of job selection are considered. The performance of the proposed heuristic algorithms is analyzed by comparing solutions with the lower bound on the optimal makespan. The extensive computational experiment shows that the proposed heuristic algorithms are able to produce near-optimal solutions in short computational time.