Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups

TL;DR: An extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers is provided, which classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times.

TL;DR: A review of the literature related to the class of scheduling problems that involve sequence-dependent setup times (costs), an important consideration in many practical applications, can be found in this paper.

TL;DR: This study strives to minimize multi-objective flexible flowshop considering sequence-dependent setup times using Pareto archive concepts, and investigates the performance of the algorithm through comparing two last stage of it with a distinguished benchmark, multi-Objective genetic algorithm (MOGA).

TL;DR: This book explores the meta-heuristics approach called tabu search, which is dramatically changing the authors' ability to solve a host of problems that stretch over the realms of resource planning, telecommunications, VLSI design, financial analysis, scheduling, spaceplanning, energy distribution, molecular engineering, logistics, pattern classification, flexible manufacturing, waste management,mineral exploration, biomedical analysis, environmental conservation and scores of other problems.

TL;DR: A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum.

TL;DR: In this paper, Johnson and Papadimitriou proposed a performance guarantee for heuristics, based on the notion of well-solved special cases (P. Gilmore, et al.).

TL;DR: This paper presents tabu search, a heuristic procedure designed to guide other methods to escape the trap of local optimality, which has obtained optimal and near optimal solutions to a wide variety of classical and practical problems.