Journal Article10.4028/WWW.SCIENTIFIC.NET/AMR.655-657.1670
Research on Open Shop Scheduling Based on Genetic Algorithm
TL;DR: A mixed integer programming model was established with the objective to minimize the makespan based on the characteristics of the open shop, and a evolution genetic algorithm (EGA) was proposed, and particular crossover operation was proposed which generated multiple offspring at a time.
read more
Abstract: Open shop scheduling problem is a typical NP problem with wide engineering background. It is of importance with respect of theory and application. In this paper, a mixed integer programming model was established with the objective to minimize the makespan based on the characteristics of the open shop, and a evolution genetic algorithm(EGA) was proposed. The representation of chromosome used in this paper was composed of two layers: operation layer and machine layer, which can be encoded and decoded easily. In generating initial population, DS/LTRP heuristic was used in order to improve the quality of the population. And particular crossover operation was proposed, which generated multiple offspring at a time, so that the efficiency of the algorithm can be well improved. At last, the proposed algorithm was tested on taillard benchmark, and numerical example showed good result.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
Benchmarks for basic scheduling problems
TL;DR: This paper proposes 260 randomly generated scheduling problems whose size is greater than that of the rare examples published, and the objective is the minimization of the makespan.
2.5K
Open Shop Scheduling to Minimize Finish Time
Teofilo F. Gonzalez,Sartaj Sahni +1 more
TL;DR: It is shown that the problem of obtaining minimum finish time nonpreemptive schedules when the open shop has more than two processors is NP-complete.
712
•Proceedings Article
Complete MCS-based search: application to resource constrained project scheduling
Philippe Laborie
- 30 Jul 2005
TL;DR: A simple complete search for cumulative scheduling based on the detection and resolution of minimal critical sets (MCS) and an extension of the search procedure using self-adapting shaving is proposed.
A genetic algorithm for the proportionate multiprocessor open shop
TL;DR: A compu-search methodology (a genetic algorithm (GA) is developed to schedule the shop with the objective of minimizing the makespan and successful experiments on large-scale problem instances suggest the readiness of the GA for industrial use.
63
Multirecombinated Evolutionary Algorithms for the Flow Shop Scheduling Problem
Susana Cecilia Esquivel,Federico Zuppa,Raúl Hector Gallard +2 more
- 18 Sep 2000
TL;DR: This work shows an implementation of diverse evolutionary approaches on a set of flow shop scheduling instances, including latest approaches using a multirecombination feature.
7