A warning about cyclic lot scheduling with sequence dependent set-up times

MICHAEL W. CARTER Department of Industrial Engineering, University of Toronto, Toronto, Ontario, M5S 1Al, Canada

MICHAEL J. MAGAZINE Department of Management Sciences, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

TAE-SHIK MOON Department of Management Sciences, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

Abstract

Many researchers solve scheduling problems with sequence dependent set-up times using a travelling salesman problem formulation. We show that this reduction may produce poor solutions when applied to the cyclic lot scheduling problem. We propose one approach that may remedy the situation.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

A warning about cyclic lot scheduling with sequence dependent set-up times

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

A warning about cyclic lot scheduling with sequence dependent set-up times

Abstract

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date