Unrelated parallel machine scheduling with job splitting

References

• Anon . 1984 . MATLAB version 4.2 , Natick, MA : The MathWorks, Inc. .
   Google Scholar
• Anon . 1994 . STATGRAPHICS Plus for Windows version 3.0 , Statistical Graphics Corp .
   Google Scholar
• Anon . 1998 . Hyper LINGO version 4.0 , Chicago, IL : LINDO Systems, Inc. .
   Google Scholar
• Azizoglu , M. and Kirca , O. 1999 . Scheduling jobs on unrelated parallel machines to minimize regular total cost functions . IIE Transactions , 31 : 153 – 159 .
   Web of Science ®Google Scholar
• Barnes , J. W. , Laguna , M. and Glover , F. 1995 . “ An overview of tabu-search approaches to production scheduling problems ” . In Intelligent Scheduling Systems , Edited by: Brown , D. E. and Scherer , W. T. pp. 101 – 127 . Boston, MA : Kluwer Publishers .
   Google Scholar
• Bradley , J. V. 1968 . Distribution-Free Statistical Tests , Englewood Cliffs, NJ : Prentice-Hall .
   Google Scholar
• Carroll , D. C. 1965 . Heuristic sequencing of jobs with single and multiple components , Cambridge, MA : Massachusetts Institute of Technology . PhD thesis
   Google Scholar
• Centeno , G. and Armacost , R. L. 1997 . “ Parallel machine scheduling with release time and machine eligibility restrictions ” . In Journal of Computers and Industrial Engineering Vol. 33 , 273 – 276 .
   Google Scholar
• Conover , W. J. 1999 . Practical Nonparametric Statistics , New York, NY : Wiley .
   Google Scholar
• Conway , R. W. , Maxwell , W. L. and Miller , L. W. 1967 . Theory of Schedulingc , Reading, MA : Addison-Wesley .
   Google Scholar
• Davis , E. and Jaffe , J. M. 1979 . Algorithms for scheduling tasks on unrelated processors , Cambridge, MA : Massachusetts Institute of Technology . Technical report, Laboratory for Computer Science
   Google Scholar
• Glass , C. A. , Potts , C. N. and Shade , P. 1994 . Unrelated parallel machine scheduling using local search . Mathematical and Computer Modeling , 20 ( 2 ) : 41 – 52 .
   Web of Science ®Google Scholar
• Glover , F. 1986 . Future paths for integer programming and links to artificial intelligence . Computers and Operations Research , 13 ( 5 ) : 533 – 549 .
   Web of Science ®Google Scholar
• Glover , F. 1989 . Tabu search–part I . ORSA Journal on Computing , 1 ( 3 ) : 190 – 206 .
   Google Scholar
• Glover , F. 1990a . Tabu search: a tutorial . Interfaces , 20 : 74 – 94 .
   Web of Science ®Google Scholar
• Glover , F. 1990b . Tabu search–part II . ORSA Journal on Computing , 2 ( 1 ) : 4 – 32 .
   Google Scholar
• Glover , F. and Laguna , M. M. 1992 . “ Tabu search ” . In Modern Heuristic Techniques for Combinatorial Problems , Edited by: Reeves , C. R. pp. 70 – 150 . New York, NY : Halsted Press .
   Google Scholar
• Glover , F. and Woolsey , E. 1972 . “ Converting the 0–1 polynomial programming problem to a 0–1 linear program ” . In Management Science Report Series , no. 72 – 3 . Boulder, CO : Business Research Division, University of Colorado .
   Google Scholar
• Hariri , A. M. A. and Potts , C. N. 1991 . Heuristics for scheduling unrelated parallel machines . Journal of Computers and Operations Research , 18 ( 3 ) : 323 – 331 .
   Web of Science ®Google Scholar
• Lee , Y. H. , Bhaskaran , K. and Pinedo , M. 1997 . A heursitic to minimize the total weighted tardiness with sequence-dependent setups . IIE Transactions , 29 : 45 – 52 .
   Web of Science ®Google Scholar
• Lenstra , J. K. , Kan , A. H. G. and Brucker , P. 1977 . Complexity of machine scheduling problems . Annals of Discrete Mathematics , 1 : 343 – 362 .
   Google Scholar
• Lenstra , J. K. , Shmoys , D. B. and Tardos , E. 1987 . Approximation algorithms for scheduling unrelated parallel machines , Amsterdam : Centre for Mathematics and Computer Science . Report OS-R8714
   Google Scholar
• Logendran , R. and Sonthinen , A. 1997 . A tabu-search-based approach for scheduling job-shop type flexible manufacturing systems . Journal of the Operational Research Society , 48 : 264 – 277 .
   Web of Science ®Google Scholar
• Montgomery , D. C. 2001 . Design and Analysis of Experiments , New York, NY : Wiley .
   Google Scholar
• Muller , F. M. , Franca , P. M. and Guidini , C. M. 1995 . “ A diversification strategy for a tabu search heuristic to solve the multiprocessor scheduling problem with sequence dependent setup times ” . In Proceedings of the 11th ISPE/IEE/IFAC International Conference on CAD/CAM Robotics and Factories of the Future'95 , pp. 217 – 222 . Pereira, Columbia : Universidad Technologica de Pereira .
   Google Scholar
• Neave , H. R. and Worthington , P. L. 1988 . Distribution-Free Tests , London, UK : Unwin Human .
   Google Scholar
• Ow , P. S. and Morton , T. E. 1989 . The single machine early/tardy problem . Management Science , 35 ( 2 ) : 177 – 191 .
   Web of Science ®Google Scholar
• Piersma , N. and Van Dijk , W. 1996 . A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search . Mathematical and Computer Modeling , 24 ( 9 ) : 11 – 19 .
   Web of Science ®Google Scholar
• Pinedo , M. P. 1995 . Scheduling: Theory, Algorithms, and Systems , Englewood Cliffs, NJ : Prentice-Hall .
   Google Scholar
• Rachamadugu , R. V. and Morton , T. E. 1981 . Myopic heuristics for the single machine weighted tardiness problem , Pittsburgh, PA : Carnegie-Mellon University . Working paper 28–81-82, Graduate School of Industrial Administration
   Google Scholar
• Schutten , J. M. J. and Leussink , R. A. M. 1996 . Parallel machine scheduling with release dates, due dates, and family setup times . International Journal of Production Economics , 46/47 : 119 – 125 .
   Web of Science ®Google Scholar
• Serafini , P. 1996 . Scheduling jobs on several machines with job splitting property . Operations Research , 44 : 617 – 628 .
   Web of Science ®Google Scholar
• Suresh , V. and Chaudhuri , D. 1994 . Minimizing maximum tardiness for unrelated parallel machines . International Journal of Production Economics , 34 : 223 – 229 .
   Web of Science ®Google Scholar
• Suresh , V. and Chaudhuri , D. 1996 . Scheduling of unrelated parallel machines when machine availability is specified . Production Planning and Control , 7 ( 4 ) : 393 – 400 .
   Web of Science ®Google Scholar
• Vepsalainen , A. P. J. and Morton , T. E. 1987 . Priority rules for job shops with weighted tardiness costs . Management Science , 33 ( 8 ) : 1035 – 1047 .
   Web of Science ®Google Scholar
• Watters , L. J. 1967 . Reduction of integer polynomial programming problems to zero-one linear programming problems . Operations Research , 15 : 1171 – 1174 .
   Web of Science ®Google Scholar
• Xing , W. and Zhang , J. 2000 . Parallel machine scheduling with splitting jobs . Discrete Applied Mathematics , 103 : 259 – 269 .
   Web of Science ®Google Scholar
• Yaghubian , A. R. , Hodgson , T. J. , Joines , J. A. , Culbreth , C. T. and Huang , J. C. 1999 . Dry kiln scheduling in furniture production . IIE Transactions , 31 : 733 – 738 .
   Web of Science ®Google Scholar