Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
Year of publication: |
2009
|
---|---|
Authors: | Tian, Zhongjun ; Ng, C. T. ; Cheng, T. C. E. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 37.2009, 5, p. 368-374
|
Subject: | Scheduling-Verfahren | Scheduling problem | Terminplanung | Time scheduling | Operations Research | Operations research |
-
Scheduling of concurrent engineering projects in the semiconductor memory industry
Benke, Philipp Robert, (2007)
-
Minimizing mean squared deviation of completion times about a common due date
Bagchi, Uttarayan, (1987)
-
Appointment scheduling under patient no-shows and service interruptions
Luo, Jianzhe, (2012)
- More ...
-
RFID investment strategy for fresh food supply chains
Fu, Na, (2019)
-
Nong, Q. Q., (2008)
-
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
Nong, Q. Q., (2008)
- More ...