Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
One-pass batching algorithms for the one-machine problem
Discrete Applied Mathematics
Simulated annealing: theory and applications
Simulated annealing: theory and applications
The single machine early/tardy problem
Management Science
Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
Annals of Operations Research
The lessons of flowshop scheduling research
Operations Research
On the heuristic solution of the permutation flow shop problem by path algorithms
Computers and Operations Research
The complexity of one-machine batching problems
Discrete Applied Mathematics - Special issue on new frontiers in the theory and practice of combinatorial optimization: applications in manufacturing and VLSI design
Insertion techniques for the heuristic solution of the job shop problem
Proceedings of the workshop on Discrete algorithms
Improving local search heuristics for some scheduling problems—I
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Improving local search heuristics for some scheduling problems. Part II
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Using Genetic Algorithms to Schedule Flow Shop Releases
Proceedings of the 3rd International Conference on Genetic Algorithms
Two-machine shop scheduling problems with batch processing
Mathematical and Computer Modelling: An International Journal
Batching in single operation manufacturing systems
Operations Research Letters
Local search heuristics for two-stage flow shop problems with secondary criterion
Computers and Operations Research
Bi-objective group scheduling in hybrid flexible flowshop: A multi-phase approach
Expert Systems with Applications: An International Journal
Improved MILP models for two-machine flowshop with batch processing machines
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.98 |
In this paper, we propose different heuristic algorithms for flow shop scheduling problems, where the jobs are partitioned into groups or families. Jobs of the same group can be processed together in a batch but the maximal number of jobs in a batch is limited. A setup is necessary before starting the processing of a batch, where the setup time depends on the group of the jobs. In this paper, we consider the case when the processing time of a batch is given by the maximum of the processing times of the operations contained in the batch. As objective function we consider the makespan as well as the weighted sum of completion times of the jobs. For these problems, we propose and compare various constructive and iterative algorithms. We derive suitable neighbourhood structures for such problems with batch setup times and describe iterative algorithms that are based on different types of local search algorithms. Except for standard metaheuristics, we also apply multilevel procedures which use different neighbourhoods within the search. The algorithms developed have been tested in detail on a large collection of problems with up to 120 jobs.