Scheduling in a flexible job shop with continuous operations at the last stage

T Zhang and O Rose

Journal of Simulation, 2016, vol. 10, issue 2, 80-88

Abstract: A special flexible job shop scheduling problem is presented. The problem has continuous-operation constraints at the last stages. A formulation of the problem is given and an integrated approach combining the simulation of production processes and the genetic algorithm is used to solve the problem. The processing paths of all jobs are decision variables and designed to be one individual in the genetic algorithm. The simulation with the reverse process flows evaluates the feasibility and fitness values of individuals. A satisfactory solution can be obtained after evolution. In order to improve the robustness, certain amounts of jobs are always kept in front of the machines at the last stages. Finally, the proposed approach is applied to one steel-making plant and compared with a hierarchical approach.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1057/jos.2015.20 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjsmxx:v:10:y:2016:i:2:p:80-88

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjsm20

DOI: 10.1057/jos.2015.20

Access Statistics for this article

Journal of Simulation is currently edited by Christine Currie

More articles in Journal of Simulation from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().