A Simple Heuristic for M-Machine Flow-Shop and its Applications in Routing-Scheduling Problems

Authors:
Igor Averbakh;Oded Berman
Affiliations:
-;-
Venue:
Operations Research
Year:
1999

Citing 0
Cited 5

Heuristic Algorithms for Solving Uncertain Routing-Scheduling Problem

ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Hybrid solution algorithms for task scheduling problem with moving executors

Engineering Applications of Artificial Intelligence
The routing open shop problem: new approximation algorithms

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Improved approximation algorithms for routing shop scheduling

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Efficient approximation algorithms for the routing open shop problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the routing-scheduling version of the flow-shop problem, where n jobs located at different nodes of a transportation network must be executed by m machines (servers) travelling between the jobs. The objective is to minimize the makespan. For this problem, we present a simple heuristic and analyze its worst-case performance.