The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Sun, Kaibiao, Li, Hongxing (2009)
Discrete Dynamics in Nature and Society
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...
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...
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...
Cyril Briand, Samia Ourari, Brahim Bouzouia (2010)
RAIRO - Operations Research
Similarity:
This paper considers the problem of scheduling jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Preemption is not allowed. On the basis of analytical and numerical dominance conditions, an efficient integer linear programming formulation is proposed for this problem, aiming at minimizing the maximum lateness ( ). Experiments have been performed by means of a commercial solver that show that this formulation...
Jacek Błażewicz, Paolo Dell'Olmo, Maciej Drozdowski (2010)
RAIRO - Operations Research
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.
Commander Anil Rana, Ajit Verma, As Srividya (2010)
The Yugoslav Journal of Operations Research
Similarity: