Solving production scheduling with earliness/tardiness penalties by constraint programming

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00161986" target="_blank" >RIV/68407700:21230/11:00161986 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10845-009-0318-2" target="_blank" >http://dx.doi.org/10.1007/s10845-009-0318-2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10845-009-0318-2" target="_blank" >10.1007/s10845-009-0318-2</a>

Result language
angličtina
Original language name
Solving production scheduling with earliness/tardiness penalties by constraint programming
Original language description
This paper deals with an application of constraint programming in production scheduling with earliness and tardiness penalties that reflects the scheduling part of the Just-In-Time inventory strategy. Two scheduling problems are studied, an industrial case study problem of lacquer production scheduling, and also the job-shop scheduling problem with earliness/tardiness costs. The paper presents two algorithms that help the constraint programming solver to find solutions of these complex problems. The conducted experiments, using case study instances and randomly generated problem instances, show that our algorithms outperform generic approaches, and on average give better results than other nontrivial algorithms.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)