Alternative graph formulation for solving complex factory-scheduling problems

References

• ADAMS , J. , BALAS , E. and ZAWACK , D. 1988 . The shifting bottleneck procedure for job shop scheduling . Management Science , 34 : 391 – 401 .
   Web of Science ®Google Scholar
• APPLEGATE , D. and Corr , W. 1991 . A computational study of the job shop scheduling problem . Orsu Journal on Computing , 3 : 149 – 156 .
   Google Scholar
• ARRIB , C. , PACCLAKELLI , D. and SMRIGLIO , S. 1999 . A three-dimensional matching model for perishable production scheduling . Discrete Applied Mathematics , 92 : 1 – 15 .
   Web of Science ®Google Scholar
• BALAS , E. 1979 . Disjunctive programming . Annals of Discrete Mathematies , 5 : 3 – 51 .
   Google Scholar
• BRUCKER , P. , JURISH , B. and SIEVERS , B. 1994 . A branch and bound algorithm For the jobshop scheduling problem . Discrete Applied Mathematies , 49 : 107 – 127 .
   Web of Science ®Google Scholar
• CARLIER , J. and PINSON , E. 1994 . Adjustment of heads and tails for the job-shop problem . European Journal of Operational Research , 78 : 146 – 161 .
   Web of Science ®Google Scholar
• DELI 'AMICO , M. and TRUBIAN , M. 1993 . Applying taboo search to the job-shop scheduling problem . Annals of Operations Research , 41 : 231 – 252 .
   Google Scholar
• GRANOWSKI , J. , PEMPERA , J. and SMUTNIGRI , C. Scheduling in production of concrete wares . Operations Research Proceedings 1996 (Braunsehwelg) . Berlin . pp. 192 – 196 . Springer .
   Google Scholar
• HALL , N.J. and SRISK ANDARAJAH , C. 1996 . A survey on machine scheduling problems with blocking and no-wait In process . Operation. Research , 44 : 510 – 525 .
   Web of Science ®Google Scholar
• LAWRENCE , S. 1984 . “ Supplement ” . In 'Resource constrained project scheduling: an experimental investigation of heuristic schedilling techniques' , Pittsburgh : GSIA. Carnagie Mellon University .
   Google Scholar
• LIXIN TANG, JIYIN LIU, AIYJNG RONG; and ZIHOG . 2000 . A mathematical programming model for scheduling steelmaking-continuous casting production . European Journal of Operational Research , 120 : 423 – 435 .
   Web of Science ®Google Scholar
• MASCIS , A. and PACCIARELL , D. 2000 . Machine scheduling via alternative graphs. Report DIA-46-2000 , Rome : Dipartimento di Informatica e Automazione. Universita Roma Tre .
   Google Scholar
• MeCoRMICK , S. T. , PINEDO , M. L. , SHEBRCR , S. and WoLF , B. 1989 . Sequencing in an assembly line with blocking to minimize cycle time . Operations Research , 37 : 925 – 935 .
   Web of Science ®Google Scholar
• MUTH , J. F. and THOMPSON , G. L. , eds. 1963 . Industrial Seheduling , Dordrecht , , The Netherlands : Kluwer .
   Google Scholar
• NAHMJAS , S. 1982 . Perishable inventory theory: a review . Operations Research , 30 : 680 – 708 .
   PubMed Web of Science ®Google Scholar
• NOWICKI , E. and SMUTNICRI , C. 1996 . A Fast taboo search algorithm for the job shop scheduling problem . Management Science , 42 : 797 – 813 .
   Web of Science ®Google Scholar
• OVACIK , 1. M. and UZSOY , R. 1992 . A shifting bottleneck algorithm for scheduling .semiconductor testing operations . Journal of Electronic Manufacturing , 2 : 119 – 134 .
   Google Scholar
• OVACIK , I. M. and UZSOY , R. 1997 . Decomposition Methods for Complex Factory- Scheduling Problems , Englewood Cliffs , NJ : Prentiee-HaII .
   Google Scholar
• PINEDO , M. 1995 . Seheduling Theory. Algarithms and Systems , Englewood Cliffs , NJ : Prentice-Hall .
   Google Scholar
• REKLAITIS , G. V. 1982 . Review of scheduling of process operations . AlChE Symposium Series , 78 : 119 – 133 .
   Google Scholar
• Roy , B. and SUSSMAN , B. 1964 . Les problem d'ordonnancement avec contraintes disjunctives. Note DS No. 9his , Paris : SEMA .
   Google Scholar
• SADEH , N. , SYCARA , K. and XIONG , Y. 1995 . Backtracking techniques for the job shop scheduling construints satisfaction problem . Artificial Intelligence , 76 : 455 – 480 .
   Web of Science ®Google Scholar
• SCHUTTEN , J. M. J. 1998 . Practical job shop scheduling . Annuls of Operations Research , 83 : 161 – 177 .
   Web of Science ®Google Scholar
• STRUSEVICH , V. A. 1997 . Shop scheduling problems under precedence constraints . Annuls of Operations Research , 69 : 351 – 377 .
   Web of Science ®Google Scholar
• WHITE , K. P. and ROGERS , R. V. 1990 . Job-shop scheduling: limits of the binary disjunctive formulation . International Journal of Production Research , 28 : 2187 – 2200 .
   Web of Science ®Google Scholar