Showing 1 - 10 of 10
The note deals with machine scheduling problems with a more general learning effect model, i.e., the actual job …. We show that some single machine scheduling problems are still polynomially solvable under the proposed model. We also … show that some special cases of the flow shop scheduling problems can be solved in polynomial time. …
Persistent link: https://www.econbiz.de/10011278975
We consider the online bounded-batch scheduling to minimize total weighted completion time on parallel machines. In the …
Persistent link: https://www.econbiz.de/10011043221
This paper considers coordinated scheduling on parallel identical machines with batch delivery. Jobs are first …
Persistent link: https://www.econbiz.de/10011043310
In this paper, we study the problem of minimizing the maximum total completion time per machine on m parallel and identical machines. We prove that the problem is strongly NP-hard if m is a part of the input. When m is a given number, a pseudo-polynomial time dynamic programming is proposed. We...
Persistent link: https://www.econbiz.de/10011117500
A single-machine scheduling problem with workload-dependent maintenance duration is considered. The objective is to …
Persistent link: https://www.econbiz.de/10011190632
Persistent link: https://www.econbiz.de/10011309063
Persistent link: https://www.econbiz.de/10010485946
Persistent link: https://www.econbiz.de/10010337503
Persistent link: https://www.econbiz.de/10010410319
Persistent link: https://www.econbiz.de/10010487456