Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective

By Kim D.-W.   Na D.-G.   Frank Chen F.  

Robotics and Computer-Integrated Manufacturing, Vol. 19, Iss. 1, 2003-02 ,pp. : 173-181

Elsevier

Access to resources Recommend Favorite

A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines

By Conde Eduardo  

Optimization Letters, Vol. 8, Iss. 4, 2014-04 ,pp. : 1577-1589

Springer Publishing Company

Access to resources Recommend Favorite

A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness

By Khan B. Shahul Hamid   Prabhaharan G.   Asokan P.  

International Journal of Computer Mathematics, Vol. 84, Iss. 12, 2007-12 ,pp. : 1731-1741

Taylor & Francis Ltd

Access to resources Recommend Favorite

Algorithms with limited number of preemptions for scheduling on parallel machines

By Jiang Yiwei   Weng Zewei   Hu Jueliang  

Journal of Combinatorial Optimization, Vol. 27, Iss. 4, 2014-05 ,pp. : 711-723

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