Related content

Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time

By Baptiste Philippe  

Mathematical Methods of Operations Research, Vol. 60, Iss. 1, 2004-09 ,pp. : 145-153

Springer Publishing Company

Access to resources Recommend Favorite

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

Bicriteria scheduling on parallel machines: total tardiness and weighted flowtime in fuzzy environment

By Sharma Sameer  

International Journal of Mathematics in Operational Research, Vol. 5, Iss. 4, 2013-06 ,pp. : 492-507

Inderscience Publishers

Access to resources Recommend Favorite

A NEURAL NETWORK MODEL FOR THE COMMON DUE DATE JOB SCHEDULING ON UNRELATED PARALLEL MACHINES

By HAMAD A.   SANUGI B.   SALLEH S.  

International Journal of Computer Mathematics, Vol. 80, Iss. 7, 2003-07 ,pp. : 845-851

Taylor & Francis Ltd

Access to resources Recommend Favorite

On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time

By Chen Bo   Deng Xiaotie   Zang Wenan  

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 85-95

Springer Publishing Company

Access to resources Recommend Favorite