Single machine scheduling to minimize weighted earliness subject to maximum tardiness

Tsiushuang, Chen; Qi, Xinyuan; Tu, Fengsheng

doi:10.1016/s0305-0548(96)00037-8

Cited by 8 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Deadlines / Due Dates All jobs to be scheduled may have the same due dates and all the jobs must be processed before this date. But, in most real industry problems that has to deal with customer orders and product shipments, each job may possess different due dates [Tsiushuang et al, 1997]. The completion of a job after its due date is allowed, but a penalty is incurred.…”

Section: Processing Timementioning

confidence: 99%

Multiprocessor Scheduling

2002

Scheduling in Real‐Time Systems

View full text Add to dashboard Cite

Scheduling theory is concerned with the optimal allocation of scarce resources (for instance, machines, processors, robots, operators, etc.) to activities over time, with the objective of optimizing one or several performance measures. The study of scheduling started about fifty years ago, being initiated by seminal papers by Johnson (1954) and Bellman (1956). Since then machine scheduling theory have received considerable development. As a result, a great diversity of scheduling models and optimization techniques have been developed that found wide applications in industry, transport and communications. Today, scheduling theory is an integral, generally recognized and rapidly evolving branch of operations research, fruitfully contributing to computer science, artificial intelligence, and industrial engineering and management. The interested reader can find many nice pearls of scheduling theory in textbooks, monographs and handbooks by Tanaev et al. (1994a,b),

show abstract

Section: Processing Timementioning

confidence: 99%

Multiprocessor Scheduling

2002

Scheduling in Real‐Time Systems

View full text Add to dashboard Cite

show abstract

“…Qi and Tu (1998), in addition to the no tardy jobs constraint, impose the additional condition that the due dates are determined by the equal slack (SLK) method. A more general problem, where a maximum tardiness is specified for each job, has been considered by Tsiushuang, Xiangtong, and Fengsheng (1997). Verma and Dessouky (1998) analysed a problem with unit-time jobs and additional tardiness penalties.…”

Section: Introductionmentioning

confidence: 99%

Local and global dominance conditions for the weighted earliness scheduling problem with no idle time

Valente

2006

Computers & Industrial Engineering

View full text Add to dashboard Cite

In this paper, we present dominance conditions for the single machine weighted earliness scheduling problem with no idle time. We also propose an algorithm that can be used to improve upper bounds for the weighted earliness criterion and lower bounds for an earliness/tardiness problem. The computational tests show that the algorithm is superior to an initial heuristic schedule and an existing adjacency condition.

show abstract

Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs

Wan

Yen

2009

European Journal of Operational Research

View full text Add to dashboard Cite

Single machine scheduling to minimize weighted earliness subject to maximum tardiness

Cited by 8 publications

References 10 publications

Multiprocessor Scheduling

Multiprocessor Scheduling

Local and global dominance conditions for the weighted earliness scheduling problem with no idle time

Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs

Contact Info

Product

Resources

About