Single operation earliness-tardiness scheduling with machine activation costs

IIE Transactions (Institute of Industrial Engineers)

Volumn 34, Issue 5, 2002, Pages 509-513

  Panwalkar, Shrikant S ^a   Liman, Surya D ^b  

^a PURDUE UNIVERSITY   (United States)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

MACHINE ACTIVATION COSTS; OPTIMAL SEQUENCE; POLYNOMIAL TIME ALGORITHM;

SCHEDULING;

EID: 0036568109     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013539825022     Document Type: Article

References (15)

1. Scheduling under a common due-date on parallel unrelated machines
2. Sequencing with earliness and tardiness penalties: A review
3. Multiple-machine scheduling with earliness, tardiness and completion time penalties
4. Optimal common due date with limited completion time deviation
5. Parallel-machine scheduling problems with earliness and tardiness penalties
6. Due-date assignment and early/tardy scheduling on identical parallel machines
7. Scheduling to a common due date on parallel uniform processors
8. Scheduling problems with generalized due dates
9. Earliness-tardiness scheduling problems II: Deviation of completion times about a restrictive common due date
10. Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date
11. Minimizing the average deviation of job completion times about a common due date
12. Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
13. Error bound of a heuristic for the common due date scheduling problem
14. Common due date assignment to minimize total penalty for the one machine scheduling problem
15. Scheduling problems with non-regular penalty functions - a review