Scheduling tasks on a flexible manufacturing machine to minimize tool change delays

DOI10.1016/J.EJOR.2003.12.025MaRDI QIDQ1767682zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Flexible manufacturing systemsPrecedence constraintsSchedulingTool changes

Mathematics Subject Classification ID

Production models (90B30) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling with tool changes to minimize total completion time under controllable machining conditions
• Scheduling flexible machining and assembly systems
• Scheduling methods for a class of flexible manufacturing systems
• Minimizing maximum tardiness in single FMS machine scheduling with tool changes
• Parallel Machine Scheduling In A Flexible Manufacturing System
• Scheduling a Flexible Batching Machine
• Simultaneous scheduling of workpieces, fixtures and cutting tools within flexible machining cells
• Adaptive scheduling and tool flow control in flexible job shops
• A feasible schedule for parallel assembly tasks in flexible manufacturing systems
• Loading and scheduling for flexible manufacturing systems with controllable processing times

Cites work

• scientific article; zbMATH DE number 1600182 (Why is no real title available?)
• scientific article; zbMATH DE number 1640601 (Why is no real title available?)
• scientific article; zbMATH DE number 1302193 (Why is no real title available?)
• scientific article; zbMATH DE number 6157240 (Why is no real title available?)
• Minimizing setups in ordered sets of fixed width
• 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
• New trends in machine scheduling
• On minimizing the jump number for interval orders
• Scheduling of resource tasks
• The Complexity of Some Problems on Subsequences and Supersequences
• The Jump Number of Dags and Posets: An Introduction
• The shortest common supersequence problem over binary alphabet is NP- complete

Cited in

(9)

• Assignment of tools to machines in a flexible manufacturing system
• Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
• Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
• A review of some issues and identification of some barriers in the implementation of FMS
• scientific article; zbMATH DE number 5310148 (Why is no real title available?)
• Anytime heuristic schedule repair in manufacturing industry
• Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
• A dynamic scheduling algorithm for singe-arm two-cluster tools with flexible processing times
• Minimizing maximum tardiness in single FMS machine scheduling with tool changes

This page was built for publication: Scheduling tasks on a flexible manufacturing machine to minimize tool change delays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1767682)