Citation
Minimizing regular criteria in the flexible job-shop scheduling problem. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 443-456, 2015.
Paper
Abstract
Algorithms for minimizing other regular criteria than the makespan in the Flexible Job-shop Scheduling Problem (FJSP) are rather scarce. In this paper, we propose a local search algorithm to optimize any regular criterion in the FJSP, which makes use of the disjunctive graph model to represent schedules and search for an optimal solution. Two neighborhood structures are proposed based on moving critical operations. E?cient conditions for testing the feasibility of moves are presented and new move evaluation functions are proposed. The e?ciency of the algorithm is shown on instances of the classical job-shop scheduling problem with total weighted tardiness, as well as on instances of the FJSP with other regular criteria.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2015-443-456-P, author = {A. Garc?a-Leon and S. Dauzere-Peres and Y. Mati},
title = {Minimizing regular criteria in the flexible job-shop scheduling problem},
booktitle = {In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic},
year = {2015},
editor = {Z. Hanzalek and G. Kendall and B. McCollum and P. Sucha},
pages = {443--456},
note = {Paper},
abstract = { Algorithms for minimizing other regular criteria than the makespan in the Flexible Job-shop Scheduling Problem (FJSP) are rather scarce. In this paper, we propose a local search algorithm to optimize any regular criterion in the FJSP, which makes use of the disjunctive graph model to represent schedules and search for an optimal solution. Two neighborhood structures are proposed based on moving critical operations. E?cient conditions for testing the feasibility of moves are presented and new move evaluation functions are proposed. The e?ciency of the algorithm is shown on instances of the classical job-shop scheduling problem with total weighted tardiness, as well as on instances of the FJSP with other regular criteria.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-443-456-P.pdf} }