Optimal starting times for a class of single machine scheduling problems with earliness and tardiness penalties
Milan Vlach, Karel Zimmermann (1997)
Kybernetika
Similarity:
Milan Vlach, Karel Zimmermann (1997)
Kybernetika
Similarity:
V. T'kindt, J.-C. Billaut (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
This paper presents a state-of-the-art survey on multicriteria scheduling and introduces a definition of a multicriteria scheduling problem. It provides a framework that allows to tackle multicriteria scheduling problems, according to Decision Aid concepts. This problem is decomposed into three different problems. The first problem is about obtaining a model. The second one is how to take criteria into account and the third one is about solving a scheduling problem. An extension to an...
Adam Janiak, Tomasz Kwiatkowski, Maciej Lichtenstein (2013)
International Journal of Applied Mathematics and Computer Science
Similarity:
In this article a survey of studies on scheduling problems with a common due window assignment and earliness/tardiness penalty functions is presented. A due window is a generalization of the classical due date and describes a time interval in which a job should be finished. If a job is completed before or after the due window, it incurs an earliness or a tardiness penalty, respectively. In this survey we separately analyse the classical models with job-independent and job-dependent earliness/tardiness...
Jacek Błażewicz, Piotr Formanowicz (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper, open shop scheduling problems with limited machine availability are studied. Such a limited availability of machines may appear in many real-life situations, e.g. as preventive maintenance activities. Three types of jobs are distinguished: non-preemptable, resumable and preemptable. An operation of a resumable job if not completed before a non-availability period of a machine may be suspended and continued without additional cost when the machine becomes available. In...
M. Duran Toksarı, Daniel Oron, Ertan Güner (2010)
RAIRO - Operations Research
Similarity:
This paper studies scheduling problems which include a combination of nonlinear job deterioration and a time-dependent learning effect. We use past sequence dependent (p-s-d) setup times, which is first introduced by Koulamas and Kyparisis [ (2008) 1045–1049]. They considered a new form of setup times which depend on all already scheduled jobs from the current batch. Job deterioration and learning co-exist in various real life scheduling settings. By the effects...
Nelson Maculan, Stella C. S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Snežana Mladenović, Mirjana Čangalović (2007)
The Yugoslav Journal of Operations Research
Similarity:
Zhu, Zhanguo, Sun, Linyan, Chu, Feng, Liu, Ming (2011)
Mathematical Problems in Engineering
Similarity: