Single Machine Scheduling with Deadlines and Increasing Rates of Processing Times
The makespan, flow time and maximum lateness problems of scheduling a set of tasks with deadlines and increasing rates of processing times on a single machine are considered in this paper. We first show that, when the increasing rates of processing time are identical, the makespan problem is equival...
محفوظ في:
المؤلفون الرئيسيون: | Cheng, T. C. E., DING, Qing |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Institutional Knowledge at Singapore Management University
2000
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/lkcsb_research/873 https://doi.org/10.1007/s002360050170 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | Singapore Management University |
اللغة: | English |
مواد مشابهة
-
A Failure Prone System with Delivery Deadline and Outsourced Maintenance
بواسطة: MOOSA, Sharafali, وآخرون
منشور في: (2012) -
The Complexity of Single Machine Scheduling with Two Distinct Deadlines and Identical Decreasing Rates of Processing Times
بواسطة: Cheng, T. C. E., وآخرون
منشور في: (1998) -
Coordinated batch processing machine scheduling with job delivery in semiconductor manufacturing
بواسطة: Fu, Qing.
منشور في: (2013) -
Manpower Scheduling with Time Windows
بواسطة: LIM, Andrew, وآخرون
منشور في: (2003) -
Scheduling Start Time Dependent Tasks with Deadlines and Identical Initial Processing Times on a Single Machine
بواسطة: Cheng, T. C. E., وآخرون
منشور في: (2003)