Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning.
Zhu, Zhanguo, Sun, Linyan, Chu, Feng, Liu, Ming (2011)
Mathematical Problems in Engineering
Similarity:
Zhu, Zhanguo, Sun, Linyan, Chu, Feng, Liu, Ming (2011)
Mathematical Problems in Engineering
Similarity:
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...
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...
Commander Anil Rana, Ajit Verma, As Srividya (2010)
The Yugoslav Journal of Operations Research
Similarity:
Jan Pelikán (2011)
Kybernetika
Similarity:
The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering production jobs in mechanical engineering, in order to minimize the overall processing time, the makespan. The production jobs are processed by machines, and each job is assigned to a certain machine for technological reasons. Before processing a job, the machine has to be adjusted; there is only one adjuster who adjusts all of the machines. This problem is treated as a hybrid two-stage...
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...
Snežana Mladenović, Mirjana Čangalović (2007)
The Yugoslav Journal of Operations Research
Similarity:
Tianlong Gu, Parisa Bahri, Guoyong Cai (2003)
International Journal of Applied Mathematics and Computer Science
Similarity:
The effective scheduling of operations in batch plants has a great potential for high economic returns, in which the formulation and an optimal solution algorithm are the main issues of study. Petri nets have proven to be a promising technique for solving many difficult problems associated with the modelling, formal analysis, design and coordination control of discrete-event systems. One of the major advantages of using a Petri-net model is that the same model can be used for the analysis...
Khaled Mesghouni, Slim Hammadi, Pierre Borne (2004)
International Journal of Applied Mathematics and Computer Science
Similarity:
This paper explains how to use Evolutionary Algorithms (EA) to deal with a flexible job shop scheduling problem, especially minimizing the makespan. The Job-shop Scheduling Problem (JSP) is one of the most difficult problems, as it is classified as an NP-complete one (Carlier and Chretienne, 1988; Garey and Johnson, 1979). In many cases, the combination of goals and resources exponentially increases the search space, and thus the generation of consistently good scheduling is particularly...
Chen, Ruey-Maw, Wang, Chuin-Mu (2011)
Abstract and Applied Analysis
Similarity:
Rafał Różycki, Grzegorz Waligóra, Jan Węglarz (2016)
International Journal of Applied Mathematics and Computer Science
Similarity:
In this work we consider a problem of scheduling preemptable, independent jobs, characterized by the fact that their processing speeds depend on the amounts of a continuous, renewable resource allocated to jobs at a time. Jobs are scheduled on parallel, identical machines, with the criterion of minimization of the schedule length. Since two categories of resources occur in the problem: discrete (set of machines) and continuous, it is generally called a discrete-continuous scheduling...