Minimizing makespan for multi-spindle head machines with a mobile table

Authors:
Olga Guschinskaya;Alexandre Dolgui;Nikolai Guschinsky;Genrikh Levin
Affiliations:
Division for Industrial Engineering and Computer Science, Ecole des Mines de Saint Etienne, 158, Cours Fauriel, 42023 Saint Etienne Cedex 2, France;Division for Industrial Engineering and Computer Science, Ecole des Mines de Saint Etienne, 158, Cours Fauriel, 42023 Saint Etienne Cedex 2, France;Operational Research Laboratory, United Institute of Informatics Problems, National Academy of Sciences, Surganov Str, 6, 220012 Minsk, Belarus;Operational Research Laboratory, United Institute of Informatics Problems, National Academy of Sciences, Surganov Str, 6, 220012 Minsk, Belarus
Venue:
Computers and Operations Research
Year:
2009

Citing 8
Cited 2

Scheduling a batch processing machine with incompatible job families

Computers and Industrial Engineering
Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed

Computers and Operations Research
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

Theoretical Computer Science
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times

Computers and Operations Research
Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times

Computers and Operations Research
Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search

Computers and Operations Research
A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families

Computers and Operations Research
Three is easy, two is hard: open shop sum-batch scheduling problem refined

Operations Research Letters

Enhanced mixed integer programming model for a transfer line design problem

Computers and Industrial Engineering
A decision support system for design of mass production machining lines composed of stations with rotary or mobile table

Robotics and Computer-Integrated Manufacturing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a novel application of operational research techniques in Manufacturing. This concerns scheduling of multi-spindle head machines with a mobile table to minimize the makespan. We show that this problem can be formulated as scheduling for a single max-batch processing machine with inclusion, exclusion and precedence constraints between jobs. What makes this study unique from others in literature is that the batch processing time can exceed that of the longest job in the batch. The job compatibility and the batch time depend on the batch content, i.e. which jobs constitute the batch. This problem is transformed into finding the constrained shortest path in a specially constructed digraph. Dominance properties are developed to decrease the digraph's size. An industrial example is presented to illustrate the effectiveness of the proposed techniques.