On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

By Ng C.T.   Cheng T.C.E.   Yuan J.J.   Liu Z.H.  

Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. : 323-326

Elsevier

Access to resources Recommend Favorite

A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems

By Frangioni Antonio   Necciari Emiliano   Scutellà Maria Grazia  

Journal of Combinatorial Optimization, Vol. 8, Iss. 2, 2004-06 ,pp. : 195-220

Springer Publishing Company

Access to resources Recommend Favorite

Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines

By Li Rongheng   Cheng Xiayan   Zhou Yunxia  

Optimization, Vol. 63, Iss. 6, 2014-06 ,pp. : 867-882

Taylor & Francis Ltd

Access to resources Recommend Favorite

Two-dedicated-machine scheduling problem with precedence relations to minimize makespan

By Gafarov Evgeny   Dolgui Alexandre  

Optimization Letters, Vol. 8, Iss. 4, 2014-04 ,pp. : 1443-1451

Springer Publishing Company

Access to resources Recommend Favorite

Randomized On-Line Scheduling Similar Jobs to Minimize Makespan on Two Identical Processors

By Du Dong-lei  

Acta Mathematicae Applicatae Sinica, Vol. 21, Iss. 3, 2005-08 ,pp. : 485-488

Springer Publishing Company

Access to resources Recommend Favorite