Showing 1 - 10 of 33
Persistent link: https://www.econbiz.de/10011344159
Persistent link: https://www.econbiz.de/10012254032
We consider a variant of the NP-hard problem of assigning jobs to machines to minimize the completion time of the last job. Usually, precedence constraints are given by a partial order on the set of jobs, and each job requires all its predecessors to be completed before it can start. In this...
Persistent link: https://www.econbiz.de/10014501648
Persistent link: https://www.econbiz.de/10004995460
This paper studies a two-machine flow shop scheduling problem with a supporting precedence relation. The model originates from a real production context of a chemical factory that produces foam-rubber products. We extend the traditional two-machine flow shop by dividing the operations into two...
Persistent link: https://www.econbiz.de/10010594390
A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular criterion. Chain precedence constraints among the tasks, deterministic processing times and processing machine of each task are given.
Persistent link: https://www.econbiz.de/10010597659
In this paper we investigate two-machine flow shop scheduling problems with deteriorating jobs and chain precedence constraints. We consider two types of precedence constraints. Under the first type constraints, a successor cannot start on any machine before its predecessor has been completed on...
Persistent link: https://www.econbiz.de/10010572535
This study proposes an efficient exact algorithm for the precedence-constrained single-machine scheduling problem to minimize total job completion cost where machine idle time is forbidden. The proposed algorithm is based on the SSDP (Successive Sublimation Dynamic Programming) method and is an...
Persistent link: https://www.econbiz.de/10010666096
Persistent link: https://www.econbiz.de/10009503671
Persistent link: https://www.econbiz.de/10010364566