Showing 1 - 10 of 14
Persistent link: https://www.econbiz.de/10012214291
Persistent link: https://www.econbiz.de/10011417461
Persistent link: https://www.econbiz.de/10011444046
Persistent link: https://www.econbiz.de/10011517443
Persistent link: https://www.econbiz.de/10011611971
Persistent link: https://www.econbiz.de/10012533764
Persistent link: https://www.econbiz.de/10013363872
Persistent link: https://www.econbiz.de/10014372797
We study various two-agent scheduling problems on a single machine with equal job processing times. The equal processing time assumption enables us to design new polynomial-time or faster-than-known optimization algorithms for many problems. We prove, however, that there exists a subset of...
Persistent link: https://www.econbiz.de/10011209382
In this paper, we consider a single machine no-wait scheduling model whereby job processing times are general functions of their position in the job sequence. We assume that the single machine must operate at a certain cycle, which can be determined by the scheduler. Furthermore, exactly one job...
Persistent link: https://www.econbiz.de/10011246066