A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates

ISSN： 1619-4500

Source： 4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol.2, Iss.2, 2004-07, pp. : 129-147

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 genetic algorithm for scheduling on a single machine with set-up times and due dates

By Armentano V. A. Mazzini R.

Production Planning and Control, Vol. 11, Iss. 7, 2000-10 ,pp. : 713-720

Taylor & Francis Ltd

Access to resources Recommend Favorite

A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates

By Xu Kailiang

Annals of Operations Research, Vol. 181, Iss. 1, 2010-12 ,pp. : 303-324

Springer Publishing Company

Access to resources Recommend Favorite

A dynamic programming algorithm for single machine scheduling with ready times

By Gélinas S. Soumis F.

Annals of Operations Research, Vol. 69, Iss. 1, 1997-01 ,pp. : 135-156

Springer Publishing Company

Access to resources Recommend Favorite

One Machine Scheduling Problem with Fuzzy Random Due-Dates

By Itoh Takeshi Ishii Hiroaki

Fuzzy Optimization and Decision Making, Vol. 4, Iss. 1, 2005-02 ,pp. : 71-78

Springer Publishing Company

Access to resources Recommend Favorite

A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families

By Tangudu S. K. Kurz M. E.

Production Planning and Control, Vol. 17, Iss. 7, 2006-10 ,pp. : 728-741

Taylor & Francis Ltd

Access to resources Recommend Favorite