• norsk
    • English
  • norsk 
    • norsk
    • English
  • Logg inn
Vis innførsel 
  •   Hjem
  • Handelshøyskolen BI
  • Articles
  • Scientific articles
  • Vis innførsel
  •   Hjem
  • Handelshøyskolen BI
  • Articles
  • Scientific articles
  • Vis innførsel
JavaScript is disabled for your browser. Some features of this site may not work without it.

A batch-oblivious approach for complex job-shop scheduling problems

Knopp, Sebastian; Dauzère-Pérès, Stéphane; Yugma, Claude
Journal article, Peer reviewed
Thumbnail
Åpne
Locked until 28.04.2019 due to copyright restrictions (405.7Kb)
Permanent lenke
http://hdl.handle.net/11250/2450518
Utgivelsesdato
2017
Metadata
Vis full innførsel
Samlinger
  • Scientific articles [1334]
Originalversjon
European Journal of Operational Research, 2017, 263(1), 50-61   https://doi.org/10.1016/j.ejor.2017.04.050
Sammendrag
We consider a Flexible Job-Shop scheduling problem with batching machines, reentrant flows, sequence dependent setup times and release dates while considering different regular objective functions. Semicon- ductor manufacturing is probably one of the most prominent practical applications of such a problem. Existing disjunctive graph approaches for this combined problem rely on dedicated nodes to explicitly represent batches. To facilitate modifications of the graph, our new modeling reduces this complexity by encoding batching decisions into edge weights. An important contribution is an original algorithm that takes batching decisions “on the fly”during graph traversals. This algorithm is complemented by an inte- grated move to resequence and reassign operations. This combination yields a rich neighborhood that we apply within a local search and a Simulated Annealing (SA) metaheuristic. The latter is embedded in a Greedy Randomized Adaptive Search Procedure (GRASP) which is the most efficient approach. Numerical results for benchmark instances of different problem types show the generality and applicability of our approach. The conciseness of our idea facilitates extensions towards further complex constraints needed in real-world applications.
Beskrivelse
The accepted and peer reviewed manuscript to the article
Utgiver
Elsevier
Tidsskrift
European Journal of Operational Research

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit
 

 

Bla i

Hele arkivetDelarkiv og samlingerUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifterDenne samlingenUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifter

Min side

Logg inn

Statistikk

Besøksstatistikk

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit