Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates

Biskup, Dirk; Feldmann, Martin

doi:10.1016/s0305-0548(00)00008-3

Cited by 104 publications

(117 citation statements)

References 14 publications

Supporting

Mentioning

109

Contrasting

Unclassified

Order By: Relevance

“…The from the upper bounds proposed by Biskup and Feldmann (2001). As revealed in Table 1, on the whole, the proposed RBS algorithm outperformed the nine meta-heuristics.…”

Section: Computational Resultsmentioning

confidence: 83%

“…If a standard set of test problems is accessible, different algorithms' performances can be compared on exactly the same set of test problems. For this reason we chose 280 benchmark problems from Biskup and Feldmann (2001) as the test problems for this study.…”

Section: Test Problemsmentioning

confidence: 99%

“…The idea for this heuristic is based on work completed by Dileepan (1993) and Biskup and Feldmann (2001).…”

mentioning

confidence: 99%

See 2 more Smart Citations

Uric acid as a risk factor for progression of non-diabetic chronic kidney disease? The Mild to Moderate Kidney Disease (MMKD) Study

Sturm

Kollerits

Neyer

et al. 2008

Experimental Gerontology

153

109

View full text Add to dashboard Cite

“…The from the upper bounds proposed by Biskup and Feldmann (2001). As revealed in Table 1, on the whole, the proposed RBS algorithm outperformed the nine meta-heuristics.…”

Section: Computational Resultsmentioning

confidence: 83%

Section: Test Problemsmentioning

confidence: 99%

See 1 more Smart Citation

Uric acid as a risk factor for progression of non-diabetic chronic kidney disease? The Mild to Moderate Kidney Disease (MMKD) Study

Sturm

Kollerits

Neyer

et al. 2008

Experimental Gerontology

153

109

View full text Add to dashboard Cite

“…b) The schedule is V-shaped, but a straddling job may exist, i.e., a job whose execution starts before and finished after the due date 25 .…”

Section: Properties For the Restricted Cdd Smetspmentioning

confidence: 99%

“…The performance of the proposed PSO algorithm is examined over the most restricted instances against CDDs of the Biskup and Feldmann (2001)'s benchmarks 25 ; including 140 instances in total ranging from 10 to 1000 jobs. The results obtained are of high quality since new upper bounds have been introduced by PSO in the 82% of the examined benchmarks instances.…”

mentioning

confidence: 99%

A Particle Swarm Optimization Algorithm for Scheduling Against Restrictive Common Due Dates

Nearchou¹,

Omirou²

2013

IJCIS

View full text Add to dashboard Cite

Abstract:Focusing on the just-in-time (JIT) operations management, earliness as well as, tardiness of jobs' production and delivery should be discouraged. In accordance to this philosophy, scheduling problems involving earliness and tardiness penalties are very critical for the operations manager. In this paper, a new population heuristic based on the particle swarm optimization (PSO) technique is presented to solve the single machine early/tardy scheduling problem against a restrictive common due date. This type of scheduling sets costs depending on whether a job finished before (earliness), or after (tardiness) the specified due date. The objective is to minimize a summation of earliness and tardiness penalty costs, thus pushing the completion time of each job as close as possible to the due date. The problem is known to be NP-hard, and therefore large size instances cannot be addressed by traditional mathematical programming techniques. The performance of the proposed PSO heuristic is measured over benchmarks problems with up to 1000 jobs taken from the open literature, and found quite high and promising in respect to the quality of the solutions obtained. Particularly, PSO was found able to improve the 82% of the existing best known solutions of the examined benchmarks test problems.

show abstract

Mathematical Programming and Heuristics for Scheduling Problems with Early and Tardy Penalties

Ratli¹,

Benmansour²,

Macedo³

et al. 2013

Metaheuristics for Production Scheduling

View full text Add to dashboard Cite

Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates

Cited by 104 publications

References 14 publications

Uric acid as a risk factor for progression of non-diabetic chronic kidney disease? The Mild to Moderate Kidney Disease (MMKD) Study

Uric acid as a risk factor for progression of non-diabetic chronic kidney disease? The Mild to Moderate Kidney Disease (MMKD) Study

A Particle Swarm Optimization Algorithm for Scheduling Against Restrictive Common Due Dates

Mathematical Programming and Heuristics for Scheduling Problems with Early and Tardy Penalties

Contact Info

Product

Resources

About