Heuristics for minimizing tool switches when scheduling part types on a flexible machine

ALAIN HERTZ Département de Mathématiques, École Polytechnique Fédérate de Lausanne, Lausanne, CH-1015, Switzerland

GILBERT LAPORTE GERAD, École des Hautes Études Commerdales, 3000, chemin de la Côte-Sainte-Catherine, Montréal, H3T 2A7, Canada

MICHEL MITTAZ Département de Mathématiques, École Polytechnique Fédérate de Lausanne, Lausanne, CH-1015, Switzerland

KATHRYN E. STECKE School of Business Administration, University of Michigan, Ann Arbor, MI, 48109-1234, USA

Abstract

This article considers a tool loading problem whose objective is to minimize the number of tool switches over time in order to process several parts on a flexible machine. New heuristics are presented and compared. Some of these are shown to be superior to existing methods.

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.

Heuristics for minimizing tool switches when scheduling part types on a flexible machine

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

Heuristics for minimizing tool switches when scheduling part types on a flexible machine

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