Part Batching and Scheduling in a Flexible Cell to Minimize Setup Costs

Authors:
Alessandro Agnetis;Arianna Alfieri;Gaia Nicosia
Affiliations:
Dipartimento di Sistemi di Produzione e Economia dell'Azienda, Politecnico di Torino, Corso Duca degli Abruzzi 24, Turin, Italy. E-mail: agnetis@dii.unisi.it;Dipartimento di Sistemi di Produzione e Economia dell'Azienda, Politecnico di Torino, Corso Duca degli Abruzzi 24, Turin, Italy;Dipartimento di Informatica e Automazione, Università “Roma Tre,” via della Vasca Navale 79, 00146, Roma, Italy
Venue:
Journal of Scheduling
Year:
2003

Citing 9
Cited 2

Integer and combinatorial optimization

Integer and combinatorial optimization
Models arising from a flexible manufacturing machine, Part I: minimization of the number of tool switches

Operations Research
Models arising from a flexible manufacturing machine, Part II: minimization of the number of switching instants

Operations Research
Flow management in flexible manufacturing cells with pipeline operations

Management Science
Scheduling computer and manufacturing processes

Scheduling computer and manufacturing processes
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
Resource sharing and scheduling for cyclic production in a computer-integrated manufacturing cell

Computers and Industrial Engineering
Scheduling one batch processor subject to job release dates

Discrete Applied Mathematics
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research

A stochastic model for the analysis of a two-machine flexible manufacturing cell

Computers and Industrial Engineering
A stochastic model for the analysis of a two-machine flexible manufacturing cell

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the problem of batching parts and scheduling their operations in flexible manufacturing cells. We consider the case in which there is only one processor and no more than k parts may be present in the system at the same time. The objective is to minimize the total number of setups, given that each part requires a sequence of operations, and each operation requires a given tool. We prove that even for k=3 the problem is NP-hard and we develop a branch-and-price scheme for its solution. Moreover, we present an extensive computational experience. Finally, we analyze some special cases and related problems.