Single machine scheduling to minimize total weighted tardiness
Article Abstract:
Time approximation algorithm O (n2) for general problem of total weighted tardiness (delay time) in single machine is analyzed. Two different models of the same problem are explored, one where job due dates are affine-linear function of processing times and second where job due dates have equal slacks.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
The two-machine flow-shop problem with weighted late work criterion and common due date
Article Abstract:
A work performance measure evaluating the amount of late work in a system while ignoring the quantity of delay in a two-machine shop environment is examined. Overview of the dynamic programming method of pseudo-polynomial time complexity solution is presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs. Scheduling for a multifunction phased array radar system
- Abstracts: Three-stage flow-shop scheduling with assembly operations to minimize weighted sum of product completion times
- Abstracts: Heuristic for unrelated machine scheduling with precedence constraints. Insertion of a random task in a schedule: a real time approach
- Abstracts: Open your heart to awe and discover a new level of happiness. Your key to everyday happy
- Abstracts: In the dark. China urges U.S. to loosen export controls. EU may suspend U.S. feed imports