Scheduling with controllable processing times and compression costs using population-based heuristics

References

• Alidace , B and Ahmadian , A . 1993 . Two parallel machine sequencing problems involving controllable job processing times . European Journal of Operational Research , 70 ( 3 ) : 335 – 341 .
   Google Scholar
• Bazaraa , MS , Jarvis , JJ and Sherali , HD . 1990 . Linear programming and network flows , New York : Wiley .
   Google Scholar
• Bean , J . 1994 . Genetics and random keys for sequencing and optimization . ORSA Journal on Computing , 6 ( 2 ) : 154 – 160 .
   Google Scholar
• Biskup , D and Cheng , TCE . 1999 . Single machine scheduling with controllable processing times and earliness, tardiness and completion time penalties . Engineering Optimization , 31 ( 3 ) : 329 – 336 .
   Web of Science ®Google Scholar
• Daniels , RL and Sarin , RK . 1989 . Single machine scheduling with controllable processing times and number of jobs tardy . Operations Research , 37 ( 6 ) : 981 – 984 .
   Web of Science ®Google Scholar
• Eberhart , RC and Kennedy , J . A new optimizer using particle swarm theory . In: Proceedings of the 6th international symposium on micro machine and human science . 4–6 October 1995 . pp. 39 – 43 . Nagoya Municipal Industrial Research Institute .
   Google Scholar
• Eiben , AE and Smith , JE . 2003 . Introduction to evolutionary computing , Berlin : Springer .
   Google Scholar
• Fogel , DB . 1995 . Evolutionary computation , Piscataway, NJ : IEEE Press .
   Google Scholar
• Foulds , LR and Guochun , T . 1999 . Single machine scheduling with controllable processing times and compression costs (Part II: heuristics for the general case) . Applied Mathematics – A Journal of Chinese Universities , 14 ( 1 ) : 75 – 84 .
   Google Scholar
• Gen , M and Cheng , R . 2000 . Genetic algorithms and engineering optimisation , New York : Wiley-Interscience .
   Google Scholar
• Goldberg , DE . 1989 . Genetic algorithms in search, optimization, and machine learning , Reading, MA : Addison-Wesley .
   Google Scholar
• Guochun , T and Foulds , LR . 1998 . Single machine scheduling with controllable processing times and compression costs (Part I: equal times and costs) . Applied Mathematics – A Journal of Chinese Universities , 13 ( 4 ) : 417 – 426 .
   Google Scholar
• Holland , JH . 1975 . Adaptation in natural and artificial systems: an introductory analysis with application to biology, control and artificial intelligence , Ann Arbor, MI : University of Michigan Press .
   Google Scholar
• Hoogeveen , H and Woeginger , GJ . 2002 . Some comments on sequencing with controllable processing times . Computing , 68 ( 2 ) : 181 – 192 .
   Google Scholar
• Hoogeveen , H . 2005 . Multicriteria scheduling . European Journal of Operational Research , 167 ( 3 ) : 592 – 623 .
   Web of Science ®Google Scholar
• Kennedy , J . 1998 . “ The behavior of particles ” . In Evolutionary programming VII , Edited by: Porto , VW . 581 – 590 . New York : Springer .
   Google Scholar
• Michalewicz , Z and Fogel , DB . 2000 . How to solve it: Modern heuristics , Berlin : Springer-Verlag .
   Google Scholar
• Murata , T , Ishibuchi , H and Tanaka , H . 1996 . Multi-objective genetic algorithms and its application to flowshop scheduling . Computers and Industrial Engineering , 30 ( 4 ) : 957 – 968 .
   Web of Science ®Google Scholar
• Nearchou , AC . 2006 . Meta-heuristics from nature for the loop layout design problem . International Journal of Production Economics , 101 ( 2 ) : 312 – 328 .
   Web of Science ®Google Scholar
• Nowicki , E and Zdrzalka , S . 1990 . A survey of results for sequencing problems with controllable processing times . Discrete Applied Mathematics , 26 ( 2–3 ) : 271 – 287 .
   Web of Science ®Google Scholar
• Panwalkar , S and Rajagopalan , R . 1992 . Single-machine sequencing with controllable processing times . European Journal of Operational Research , 59 ( 2 ) : 298 – 302 .
   Web of Science ®Google Scholar
• Parsopoulos , KE and Vrahatis , MN . 2002 . Recent approaches to global optimization problems through particle swarm optimization . Natural Computing , 1 ( 2–3 ) : 235 – 306 .
   Google Scholar
• Shabtay , D and Steiner , G . 2007 . A survey of scheduling with controllable processing times . Discrete Applied Mathematics , 155 ( 13 ) : 1643 – 1666 .
   Web of Science ®Google Scholar
• Storn , R and Price , K . 1997 . Differential evolution – a simple and efficient heuristic for global optimization over continues spaces . Journal Global Optimization , 11 ( 4 ) : 341 – 359 .
   Web of Science ®Google Scholar
• Van Wassenhove , LN and Baker , KR . 1982 . A bicriterion approach to time/cost trade-offs in sequence . European Journal of Operational Research , 11 ( 1 ) : 48 – 54 .
   Web of Science ®Google Scholar
• Vickson , RG . 1980a . Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine . Operations Research , 28 ( 5 ) : 1155 – 1167 .
   Web of Science ®Google Scholar
• Vickson , RG . 1980b . Two single machine sequencing problems involving controllable job processing times . AIIE Transactions , 12 ( 3 ) : 258 – 262 .
   Web of Science ®Google Scholar
• Wan , G , Yen , BPC and Li , CL . 2001 . Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard . Information Processing Letters , 79 ( 6 ) : 273 – 280 .
   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 ( 9 ) : 519 – 524 .
   Google Scholar