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

Author： HAMAD A.   SANUGI B.   SALLEH S.  

Publisher： Taylor & Francis Ltd

ISSN： 0020-7160

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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

Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 63, Iss. 4, 2014-07 ,pp. : 306-326

John Wiley & Sons Inc

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

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

Semi-online scheduling with known maximum job size on two uniform machines

By Cao Qian   Liu Zhaohui  

Journal of Combinatorial Optimization, Vol. 20, Iss. 4, 2010-11 ,pp. : 369-384

Springer Publishing Company

Access to resources Recommend Favorite