Scheduling multi-operation jobs in partially overlapping systems

References

• Adams , J. , Balas , E. and Zawack , D. 1988 . The shifting bottleneck procedure for job shop scheduling . Mgmt Sci. , 34 : 391 – 401 .
   Web of Science ®Google Scholar
• Applegate , D. and Cook , W. 1991 . A computational study of the job-shop scheduling instance . ORSA J. Comput. , 3 : 149 – 156 .
   Google Scholar
• Baker , K. R. 1974 . Introduction to Sequencing and Scheduling , New York : Wiley .
   Google Scholar
• Bokhar , S. 1987 . Assignment Problems in Parallel and Distributed Computing , Boston : Kluwer Academic Publishers .
   Google Scholar
• Bulfin , R. and Parker , R. 1976 . On the assignment and sequencing of operations on a crew-served project . Nav. Res. Log., Q. , 23 : 261 – 269 .
   Google Scholar
• Chen , Y. and Chin , Y. 1989 . Scheduling unit time parts on processors with different capabilities . Comput. Op. Res. , 16 : 409 – 417 .
   Google Scholar
• Coffman , E. 1976 . Computer and Part-Shop Scheduling Theory , New York : Wiley .
   Google Scholar
• Donath , M. , Graves , R. and Calson , D. 1989 . flexible assembly systems: the scheduling problem for multiple products . J. Mfg Systems , 8 : 27 – 34 .
   Web of Science ®Google Scholar
• Fisher , H. and Thompson , G. L. 1963 . Industrial Scheduling , Edited by: Muth , J. F. and Thompson , G. L. 225 – 251 . New Jersey, Englewood Cliffs : Prentice Hall .
   Google Scholar
• French , S. 1982 . Sequencing and Scheduling , Chichester : Ellis Horwood Limited .
   Google Scholar
• Hansen , J. and Giauque , W. 1986 . Task allocation in distributed processing systems . Ops Res. Lett. , 5 : 137 – 143 .
   Google Scholar
• Kamel , M. and Ghenniwa , H. 1995 . Design and Implementation of Intelligent Manufacturing Systems , Edited by: Parsaei , H. and Jamshidi , M. 241 – 274 . New Jersey, Engelwood Cliffs : Prentice Hall .
   Google Scholar
• Lawler , E. , Lenstra , J. , Rinnooy Kan , A. and Shmoys , D. 1993 . Sequencing and scheduling: algorithms and complexity . Handbook Op. Res. Mgmt Sci. , 4 : 445 – 522 .
   Google Scholar
• Lenstra , J. , Shmoys , D. and Tardos , E. 1990 . Approximation algorithms for scheduling unrelated parallel machines . Mathl Prog. , 46 : 259 – 271 .
   Web of Science ®Google Scholar
• Pinedo , M. 2002 . Scheduling: Theory, Algorithms, and Systems , 2nd edition , New Jersey, Elgelwood Cliffs : Prentice-Hall .
   Google Scholar
• Rajeev , K. 1998 . A modular approach toward flexible manufacturing . Integ. Manuf. Syst. , 9 : 77 – 86 .
   Google Scholar
• Rinnooy Kan , A. 1976 . Machine Scheduling Problems: Classification, Complexity and Computations , The Hague, , Holland : Martinus Nijhoff .
   Google Scholar
• Sahni , S. 1976 . Algorithms for scheduling independent tasks . Assoc. Comput. Mach. , 23 : 116 – 127 .
   Web of Science ®Google Scholar
• Steffen , M. and Green , T. 1986 . “ An application of hierarchical planning and constraint-directed search to scheduling parallel processors ” . In Proceedings of IEEE International Conference on Robotics and Automation , 910 – 917 . Washington, DC : IEEE Computer Society Press .
   Google Scholar
• Storer , R. H. , Wu , S. D. and Vaccari , R. 1992 . New search spaces for sequencing instances with application to job shop scheduling . Mgmt Sci. , 38 : 1495 – 1509 .
   Web of Science ®Google Scholar
• Taillard , E. 1993 . Benchmarks for basic scheduling problems . Eur. J. Op. Res. , 64 : 278 – 285 .
   Web of Science ®Google Scholar
• Yamada , T. , Nakano , R. , Manner , R. and Manderick , B. , eds. 1992 . “ A genetic algorithm applicable to large-scale job-shop instances ” . In Parallel instance solving from nature 2 281 – 290 . Amsterdam, , North-Holland
   Google Scholar