A time-indexed LP-based approach for min-sum job-shop problems

Author： Lancia Giuseppe   Rinaldi Franca   Serafini Paolo  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.186, Iss.1, 2011-06, pp. : 175-198

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

Prototyped genetic search: a cybernetical approach to job-shop scheduling problems

By Khoukhi Amar  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 31, Iss. 1, 2002-02 ,pp. : 96-114

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Hybrid approach to decision-making for job-shop scheduling

By Mesghouni K.   Pesin P.   Trentesaux D.   Hammadi S.   Tahon C.   Borne P.  

Production Planning and Control, Vol. 10, Iss. 7, 1999-10 ,pp. : 690-706

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the Solution of Min-sum-min Problems

By Demyanov Alexei  

Journal of Global Optimization, Vol. 31, Iss. 3, 2005-03 ,pp. : 437-453

Springer Publishing Company

Access to resources Recommend Favorite

A genetic algorithm-based approach for job shop scheduling

By Phanden Rakesh Kumar   Jain Ajai   Verma Rajiv  

Journal of Manufacturing Technology Management, Vol. 23, Iss. 7, 2012-09 ,pp. : 937-946

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

New Single Machine and Job-Shop Scheduling Problems with Availability Constraints

By Mauguière Ph.   Billaut J.-C.   Bouquard J.-L.  

Journal of Scheduling, Vol. 8, Iss. 3, 2005-06 ,pp. : 211-231

Springer Publishing Company

Access to resources Recommend Favorite