Tsp-based scheduling in a batch-wise hybrid flow-shop

Authors:
P. Caricato;A. Grieco;D. Serino
Affiliations:
Dipartimento di Ingegneria dell'Innovazione, Universití di Lecce, Via Arnesano, Ed. La Stecca, 73100 Lecce, Italy;Dipartimento di Ingegneria dell'Innovazione, Universití di Lecce, Via Arnesano, Ed. La Stecca, 73100 Lecce, Italy;Dipartimento di Ingegneria dell'Innovazione, Universití di Lecce, Via Arnesano, Ed. La Stecca, 73100 Lecce, Italy
Venue:
Robotics and Computer-Integrated Manufacturing
Year:
2007

Citing 6
Cited 2

New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
Analysis of an asymmetric polling system

Computers and Operations Research
Variable neighborhood search

Computers and Operations Research
Hybrid flow shop scheduling: a survey

Computers and Industrial Engineering
Traveling Salesman Problems with Profits

Transportation Science
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach

Applied Soft Computing
An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the past few years, flexible production systems have allowed an extensive exploitation of new technologies, but have also led to new difficulties in production planning management science. The model presented in this paper extends the traditional HFS (hybrid flow-shop) scheduling problem to the case in which jobs are due to follow strict precedence constraints and batch assignment constraints and the parallel machines at a stage are served by a bottleneck machine. A variant of the well-known TSP problem is used to develop an efficient heuristic solution for the problem. The effectiveness of the proposed approach is validated through a comparison with different heuristics traditionally used in HFS scheduling problems. Furthermore, a simple insertion heuristic based on the TSP model of the problem is tested. Finally, a MIP-based approach is also explored to provide the optimum solutions within much larger times for comparison.