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:
Costas P.Pappis, G. I. Adamopulos (1993)
The Yugoslav Journal of Operations Research
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...
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...
Commander Anil Rana, Ajit Verma, As Srividya (2010)
The Yugoslav Journal of Operations Research
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...
Mohamed Haouari, Thouraya Daouas (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Jatinder N. D. Gupta (1976)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
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...
Cyril Briand (2009)
RAIRO - Operations Research
Similarity:
In this paper, a new schedule generation scheme for resource-constrained project scheduling problems is proposed. Given a project scheduling problem and a priority rule, a schedule generation scheme determines a single feasible solution by inserting one by one each activity, according to their priority, inside a partial schedule. The paper proposes a generation scheme that differs from the classic ones in the fact that it allows to consider the activities in any order, whether their...
N.I. Karacapilidis, C.P. Pappis (1995)
The Yugoslav Journal of Operations Research
Similarity: