Approximative procedures for no-wait job shop scheduling

Authors:
Christoph J Schuster;Jose M Framinan
Affiliations:
Institute of Mathematics, University of Duisburg, 47048 Duisburg, Germany;Industrial Management Research Group, School of Engineering, University of Seville, Seville, Spain
Venue:
Operations Research Letters
Year:
2003

Citing 3
Cited 17

New search spaces for sequencing problems with application to job shop scheduling

Management Science
A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
An effective hybrid optimization strategy for job-shop scheduling problems

Computers and Operations Research

Some local search algorithms for no-wait flow-shop problem with makespan criterion

Computers and Operations Research
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach

Computers and Operations Research
Minimizing Makespan in No-Wait Job Shops

Mathematics of Operations Research
A memetic algorithm for the job-shop with time-lags

Computers and Operations Research
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem

Computers and Operations Research
An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops

Computers and Operations Research
A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems

Computers and Operations Research
A fast hybrid tabu search algorithm for the no-wait job shop problem

Computers and Industrial Engineering
A DE-based approach to no-wait flow-shop scheduling

Computers and Industrial Engineering
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach

Computers and Operations Research
Minimizing total flow time in permutation flow shop scheduling with improved simulated annealing

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Floating-point to integer mapping schemes in differential evolution for permutation flow shop scheduling

International Journal of Bio-Inspired Computation
An island model for the no-wait flow shop scheduling problem

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Solving no-wait flow shop scheduling problems by a hybrid quantum-inspired evolutionary algorithm

MICAI'10 Proceedings of the 9th Mexican international conference on Artificial intelligence conference on Advances in soft computing: Part II
Production capacity planning and scheduling in a no-wait environment with controllable processing times: An integrated modeling approach

Expert Systems with Applications: An International Journal
Discrete harmony search algorithm for the no wait flow shop scheduling problem with makespan criterion

ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
Scheduling a single vehicle in the just-in-time part supply for a mixed-model assembly line

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we consider the no-wait job shop problem with makespan objective. Based on a decomposition of the problem into a sequencing and a timetabling problem, we propose two local search algorithms. Extensive computational tests in which the algorithms compare favorably to the best existing strategies are reported. Although not specifically designed for that purpose, our algorithms also outperform one of the best no-wait flow shop algorithms in literature.