Flow-line scheduling problem with controllable processing times

References

• Alidaee , B. and Ahmadian , A. , ( 1993 ) Two parallel machine sequencing problems involving controllable job processing times . European Journal of Operational Research , 70 , 335 – 341 .
   Web of Science ®Google Scholar
• Baker , K.R. , ( 1975 ) A comparative study of flow shop algorithms . Operations Research , 23 ( 2 ), 62 – 73 .
   Web of Science ®Google Scholar
• Bean , J.C. , ( 1994 ) Genetic algorithms and random keys for sequencing and optimization . ORSA Journal on Computing , 6 ( 2 ), 154 – 160 .
   Google Scholar
• Biegal , J. and Davern , J. , ( 1990 ) Genetic algorithms and job shop scheduling . Computers and Industrial Engineering , 19 , 81 – 91 .
   Web of Science ®Google Scholar
• Goldberg , D.E. , ( 1989 ) Genetic Algorithms in Search Optimization and Machine Learning , Addison Wesley .
   Google Scholar
• Herrman , J. and Lee , C.-Y. , ( 1995 ) Solving a class of scheduling problems with a genetic algorithm . ORSA Journal on Computing , 7 , 4 , 443 – 452 .
   Google Scholar
• Hillier , F.S. and Lieberman , G.J. , ( 1986 ) Introduction to Operations Research , Holden-Day , Oakland , CA .
   Google Scholar
• Hitomi , K. , ( 1979 ) Manufacturing Systems Engineering , Taylor & Francis , London .
   Google Scholar
• Ishii , H. , Masuda , T. and Nishida , T. , ( 1987 ) Two machine mixed shop scheduling problem with controllable machine speeds . Discrete Applied Mathematics , 17 , 29 – 38 .
   Web of Science ®Google Scholar
• Karabati , S. and Kouvelis , P. , ( 1996 ) Cyclic scheduling in flow lines modeling observations, effective heuristics and an optimal solution procedure . Naval Research Logistics , forthcoming .
   Web of Science ®Google Scholar
• Lasdon , L.S. , ( 1970 ) Optimization Theory for Large Systems . Macmil-lan , London .
   Google Scholar
• McCormick , ST. , Pinedo , M.L. and Wolf , B. , ( 1987 ) The complexity of scheduling a flexible assembly system . Working paper, Management Sciences Department, School of Business , University of British Columbia , Vancouver BC , Canada .
   Google Scholar
• McCormick , S.T. , Pinedo , M.L. , Shenker , S. and Wolf , B. , ( 1989 ) Sequencing in an assembly line with blocking to minimize cycle time . Operations Research , 37 ( 6 ), 925 – 935 .
   Web of Science ®Google Scholar
• Monma , C.L. and Rinnooy Kan , A.H.G. , ( 1983 ) A concise survey of efficiently solvable special cases of the permutation flows hop problem . RAIRO, Recherche Operationnelle , 17 , 105 – 119 .
   Web of Science ®Google Scholar
• Nowicki , E. , ( 1993 ) An approximation algorithm for the m-machine permutation flow-shop scheduling problem with controllable processing times . European Journal of Operational Research , 70 , 342 – 349 .
   Web of Science ®Google Scholar
• Nowicki , E. and Zdrzalka , S. , ( 1988 ) A two-machine flow shop scheduling problem with controllable job processing times . European Journal of Operational Research , 34 , 208 – 220 .
   Web of Science ®Google Scholar
• Nowicki , E. and Zdrzalka , S. , ( 1990 ) A survey of results for sequencing problems with controllable job processing times . Discrete Applied Mathematics , 26 , 271 – 287 .
   Web of Science ®Google Scholar
• Panwalkar , S.S. and Raj ago pal an , R. , ( 1992 ) Single machine sequencing problem with controllable processing times . European Journal of Operational Research , 59 , 298 – 302 .
   Web of Science ®Google Scholar
• Schweitzer , P.J. and Seidmann , A. , ( 1991 ) Processing rate optimization in flexible manufacturing systems . Management Science , 37 , 454 – 466 .
   Web of Science ®Google Scholar
• Trick , M.A. , ( 1994 ) Scheduling multiple variable-speed machines . Operations Research , 42 ( 2 ), 234 – 248 .
   Web of Science ®Google Scholar
• Van Vliet , M. and Wagelmans , A.P.M. , ( 1990 ) Speeding up machines in a two machine flow shop. Working Paper , Tinbergen Institute, Erasmus University , The Netherlands .
   Google Scholar
• Vickson , R.G. , ( 1980a ) Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine . Operations Research , 28 , 1155 – 1167 .
   Web of Science ®Google Scholar
• Vickson , R.G. , ( 1980b ) Two single machine sequencing problems involving controllable job processing times . AIIE Transactions , 12 , 258 – 262 .
   Web of Science ®Google Scholar
• Wittrock , R.J. , ( 1985 ) Scheduling algorithms for flexible flow lines . IBM Journal of Research and Development , 29 , 401 – 412 .
   Web of Science ®Google Scholar
• Zdrzalka , S. , ( 1991 ) Scheduling jobs on a single machine with release dates, delivery times and controllable processing times worst case analysis . Operations Research Letters , 10 , 519 – 523 .
   Web of Science ®Google Scholar