A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan

By Yuan Jinjiang  

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 361-369

Springer Publishing Company

Access to resources Recommend Favorite

Analysis of antithetic sequences in flowshop scheduling to minimize makespan

By Moras R.   Smith M. L.   Kumar K. S.   Azim M. A.  

Production Planning and Control, Vol. 8, Iss. 8, 1997-12 ,pp. : 780-787

Taylor & Francis Ltd

Access to resources Recommend Favorite

Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs

By Toksarı M.  

Journal of Intelligent Manufacturing, Vol. 21, Iss. 6, 2010-12 ,pp. : 843-851

Springer Publishing Company

Access to resources Recommend Favorite

Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan: Models and Algorithms for Planning and Scheduling Problems (Editors: Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz)

By Gupta Jatinder N.D.  

Annals of Operations Research, Vol. 129, Iss. 1-4, 2004-07 ,pp. : 171-185

Springer Publishing Company

Access to resources Recommend Favorite

Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan: Models and Algorithms for Planning and Scheduling Problems (Editors: Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz)

By Błażewicz Jacek   Machowiak Maciej   Węglarz Jan   Kovalyov Mikhail Y.   Trystram Denis  

Annals of Operations Research, Vol. 129, Iss. 1-4, 2004-07 ,pp. : 65-80

Springer Publishing Company

Access to resources Recommend Favorite