Hybrid flow shop scheduling: a survey
Computers and Industrial Engineering
An Enhanced TSP-Based Heuristic for Makespan Minimizationin a Flow Shop with Setup Times
Journal of Heuristics
Heuristics for hybrid flow shops with controllable processing times and assignable due dates
Computers and Operations Research
A hybrid two-stage flowshop with limited waiting time constraints
Computers and Industrial Engineering
A new approach to solve hybrid flow shop scheduling problems by artificial immune system
Future Generation Computer Systems - Special issue: Computational science of lattice Boltzmann modelling
Computers and Operations Research
Computers and Operations Research
A note on two-stage hybrid flowshop scheduling with missing operations
Computers and Industrial Engineering
A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems
Journal of Intelligent Manufacturing
Scheduling deteriorating jobs on a single machine subject to breakdowns
Journal of Scheduling
Journal of Intelligent Manufacturing
Hi-index | 0.00 |
This paper considers a two-stage hybrid flowshop scheduling problem in machine breakdown condition. By machine breakdown condition we mean that the machine may not always be available during the scheduling period. Machine failure may occur with a known probability after completing a job. Probability of machine failure depends on the previous processed job. The problem to be studied has one machine at the first stage and M parallel identical machines at the second stage. The objective is to find the optimal job combinations and the optimal job schedule such that the makespan is minimized. The proposed problem is compatible with a large scope of real world situations. To solve the problem, first, we introduce one optimal approach for job precedence when there is one machine in both stages and then provide a heuristic algorithm when there are M machines in stage two. To examine the performance of the heuristic, some experiments used are provided as well.