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:
Displaying similar documents to “Scheduling problems with a common due window assignment: A survey”
Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning.
Multicriteria scheduling problems : a survey
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...
Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects.
Sun, Kaibiao, Li, Hongxing (2009)
Discrete Dynamics in Nature and Society
Similarity:
Scheduling multiprocessor tasks on two parallel processors
Jacek Błażewicz, Paolo Dell'Olmo, Maciej Drozdowski (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.
Scheduling jobs in open shops with limited machine availability
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...
Heuristic algorithms for preemptive scheduling in a two-stage flowshop with unrelated parallel machines and 0-1 resource requirements
Ewa Figielska (2009)
Control and Cybernetics
Similarity:
Optimisation of Production Machine Scheduling Using a Two Level Mixed Optimisation Method
Commander Anil Rana, Ajit Verma, As Srividya (2010)
The Yugoslav Journal of Operations Research
Similarity:
Heuristic solving a bicriteria parallel-machine scheduling problem
Petr Fiala (1997)
Kybernetika
Similarity:
Hybrid flow-shop with adjustment
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...