Scheduling tasks on a flexible manufacturing machine to minimize tool change delays
From MaRDI portal
Publication:1767682
DOI10.1016/j.ejor.2003.12.025zbMath1057.90013OpenAlexW2033451931MaRDI QIDQ1767682
Jatinder N. D. Gupta, Klaus H. Ecker
Publication date: 8 March 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.12.025
Related Items (2)
A review of some issues and identification of some barriers in the implementation of FMS ⋮ Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing setups in ordered sets of fixed width
- New trends in machine scheduling
- On minimizing the jump number for interval orders
- The shortest common supersequence problem over binary alphabet is NP- complete
- Scheduling of resource tasks
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
- The Jump Number of Dags and Posets: An Introduction
- The Complexity of Some Problems on Subsequences and Supersequences
This page was built for publication: Scheduling tasks on a flexible manufacturing machine to minimize tool change delays