Preemptive Hybrid Flowshop Scheduling problem of interval orders

Abstract The Preemptive Hybrid (multi-processor) Flowshop Scheduling (PHFS) problem consists in preemptively scheduling n jobs in a flowshop subject to precedence constraints with the objective of minimizing the makespan . A special case of the general precedence constraints problems is NP-hard in the strong sense, Hoogeveen et al. [J.A. Hoogeveen, J.K. Lenstra, B. Veltman, European Journal of Operational Research 89 (1996) 172]. In this paper a class of precedence constraints is proposed for which the problem is polynomially solvable. The reported results demonstrate the feasibility and reliability of the proposed approach. This should open future prospects for developing approximation algorithms for any class of precedence constraints.

[1]  Omar Moursli.  Branch and Bound Lower Bounds for the Hybrid Flowshop , 1997 .

[2]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[3]  Bo Chen.  Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage , 1995 .

[4]  Khaled Djellab,et al.  Scheduling preemptive jobs with precedence constraints on parallel machines , 1999, Eur. J. Oper. Res..

[5]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[6]  M. Solomon,et al.  Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time , 1996 .

[7]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[8]  D. Chaudhuri,et al.  A multi-stage parallel-processor flowshop problem with minimum flowtime , 1992 .

[9]  A. Vignier,et al.  Contribution à la résolution des problèmes d'ordonnancement de type monogamme, multimachine (Flow-Shop Hybride) , 1997 .

[10]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[11]  Marius M. Solomon,et al.  A computational study of heuristics for two-stage flexible flowshops , 1996 .

[12]  D. Santos,et al.  Global lower bounds for flow shops with multiple processors , 1995 .

[13]  R. Möhring.  Algorithmic Aspects of Comparability Graphs and Interval Graphs , 1985 .

[14]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .

[15]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .