Integer programming models for the re-entrant shop scheduling problems

ISSN： 0305-215X

Source： Engineering Optimization, Vol.38, Iss.5, 2006-07, pp. : 577-592

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 a re-entrant job-shop scheduling problem with sequence-dependent setup times

By Sun J. U.

Engineering Optimization, Vol. 41, Iss. 6, 2009-06 ,pp. : 505-520

Taylor & Francis Ltd

Access to resources Recommend Favorite

Benchmarks for shop scheduling problems

By Demirkol E. Mehta S. Uzsoy R.

European Journal of Operational Research, Vol. 109, Iss. 1, 1998-08 ,pp. : 137-141

Elsevier

Access to resources Recommend Favorite

Asymptotic loss of priority scheduling policies in closed re-entrant lines: A computational study

By Narahari Y. Khan L.M.

European Journal of Operational Research, Vol. 110, Iss. 3, 1998-11 ,pp. : 585-596

Elsevier

Access to resources Recommend Favorite

Ranking in quadratic integer programming problems

By Gupta R. Bandopadhyaya L. Puri M.C.

European Journal of Operational Research, Vol. 95, Iss. 1, 1996-11 ,pp. : 231-236

Elsevier

Access to resources Recommend Favorite

Scheduling staff using mixed integer programming

By Beaumont N.

European Journal of Operational Research, Vol. 98, Iss. 3, 1997-05 ,pp. : 473-484

Elsevier

Access to resources Recommend Favorite