A decomposition approach for the single—machine scheduling problem

References

• Amamou , M. , Happiette , M. and Staroswiecki , M. 1992 . Decomposition of the single machine scheduling based on the notion of semi-rigid subsequences, Proc. of International Conference on Automation Technology, Taiwan, July 4–6
   Google Scholar
• Baker , K. Introduction to sequencing and scheduling Wiley, New York, 1974
   Google Scholar
• Carlier , J. 1982 . The one-machine sequencing problem, IJPR, 11 42 – 47 . p
   Google Scholar
• Carlier , J. and Pinson , E. 1994 . Adjustment of heads and tails for the job-shop problem, EJOR, 78 146 – 161 . p
   Google Scholar
• McCarthy , B. L. and Liu , J. 1993 . Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling, IJPR, 31 59 – 79 . p
   Google Scholar
• Chambers , R. , Carraway , R. , Towe , T. and Morin , T. 1991 . Dominance and decomposition heuristics for single machine scheduling Vol. 39 , 639 – 647 . Oper. Res., 4, p
   Google Scholar
• Chu , C. , Portmann , M.-C. and Proth , J.-M. 1992 . A splitting-up approach to simplify job-shop scheduling problems, IJPR, 30 859 – 870 . p
   Google Scholar
• Emmons , H. 1969 . One-machine sequencing to minimize certain functions of job tardiness, Oper. Res., 17 701 – 715 . p
   Google Scholar
• Erschler , J. , Roubellat , F. and Vernhes , J. P. 1980 . Characterizing the set of feasible sequences for n jobs to be carried out on a single machine, EJOR, 4 189 – 194 .
   Google Scholar
• Erschler , J. , Fontan , G. , Mercé , C. and Roubellat , F. 1982 . Applying new dominance concepts to job schedule optimization, EJOR, 11 60 – 66 . p
   Google Scholar
• Erschler , J. and Esquirol , P. 1986 . Decision-aid in job-shop scheduling: a knowledgebased approach, Proc. of IEEE International Conference on Robotics and Automation, San Antonio, CA 1641 – 1656 .
   Google Scholar
• Gotha . 1993 . Les problèmes d'ordonnancement, RAIRO, Rech. Op., 27 77 – 150 . p
   Google Scholar
• Graves , S. 1981 . A review of production scheduling, Oper. Res., 29 646 – 675 . p
   Google Scholar
• Jackson , J. R. 1955 . Scheduling a production line to minimize maximum tardiness, Research report 43, Management research project, University of california, Los Angeles, CA
   Google Scholar
• Kusiak , A. 1989 . Knowledge-based systems in manufacturing New-York : Taylor & Francis .
   Google Scholar
• Lageweg , B. , Lenstra , J. and Rinnooy Kan , A. 1976 . Minimizing maximum lateness on one machine: computational experience and some applications, Statis. Neerlandica, 30 25 – 41 . p
   Google Scholar
• Lenstra , J. , Rinnooy Kan , A. and Brucker , P. 1977 . Complexity of machine scheduling problems, Ann. Discrete Math., 1 343 – 362 . p
   Google Scholar
• Levy , M.-L. , Lopez , P. and Pradin , B. 1994 . Characterization of feasible schedules for the flow-shop problem: a decomposition approach, Proc. of IMSE'94, Grenoble, France, December 12–14 307 – 315 . p
   Google Scholar
• Levy , M.-L. , Lopez , P. and Pradin , B. 1995 . A decomposition approach to characterize feasible schedules for the one-machine problem, Proc. of IEPM'95, Marrakech, Morocco, April 4–7 402 – 411 . 1, p
   Google Scholar
• Levy , M.-L. , Lopez , P. and Pradin , B. 1995 . Temporal decomposition for scheduling June : LAAS technical report .
   Google Scholar
• McMahon , G. B. and Florian , M. 1975 . On scheduling with ready times and due dates to minimize maximum lateness, Oper. Res., 23 475 – 482 . p
   Google Scholar
• Nuijten , W. P. 1994 . Time and Resource Constrained Scheduling, PhD's thesis, Eindhoven University of Technology, the Netherlands M.
   Google Scholar
• Pinedo , M. Scheduling: Theory, Algorithms and Systems Prentice Hall . Engle- wood Cliffs, 199–5
   Google Scholar
• Portmann , M.-C. 1988 . Méthodes de décomposition spatiale et temporelle en ordonnancement de la production, RAIRO-APII, 22 439 – 451 . p
   Google Scholar
• Potts , C. and Van Wassenhove , L. 1987 . Dynamic programming and decomposition approaches for the single machine total tardiness problem, EJOR, 32 405 – 414 . p
   Google Scholar
• Zeng , X. , Happiette , M. and Boussemart , M. 1995 . Temporal decomposition and searching for admissible sequences on multi-machines, Proc. of IEPM'95, Marrakech, Morocco, April 4–7 412 – 421 . 1, p
   Google Scholar