Showing 1 - 10 of 81
We consider the m-machine ordered flow shop scheduling problem with machines subject to maintenance and with the makespan as objective. It is assumed that the maintenances are scheduled in advance and that the jobs are resumable. We consider permutation schedules and show that the problem is...
Persistent link: https://www.econbiz.de/10008865043
We consider coordination mechanisms for the distributed scheduling of n jobs on m parallel machines, where each agent holding a job selects a machine to process his/her own job. Without a central authority to construct a schedule, each agent acts selfishly to minimize his/her own disutility,...
Persistent link: https://www.econbiz.de/10010597602
This paper focuses on single machine scheduling subject to inventory constraints. Jobs either add items to an inventory or remove items from that inventory. Jobs that have to remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a...
Persistent link: https://www.econbiz.de/10008865209
This paper considers a two-stage production scheduling problem in which each activity requires two operations to be processed in stages 1 and 2, respectively. There are two options for processing each operation: the first is to produce it by utilizing in-house resources, while the second is to...
Persistent link: https://www.econbiz.de/10009146044
We consider parallel machine scheduling problems where the processing of the jobs on the machines involves two types of objectives. The first type is one of two classical objective functions in scheduling theory: either the total completion time or the makespan. The second type involves an...
Persistent link: https://www.econbiz.de/10010871187
Persistent link: https://www.econbiz.de/10011687229
Persistent link: https://www.econbiz.de/10011698219
Persistent link: https://www.econbiz.de/10012157297
Persistent link: https://www.econbiz.de/10011941729
Persistent link: https://www.econbiz.de/10012495194