Scheduling shops to minimize the weighted number of late jobs

Authors:
Joanna Józefowska;Bernd Jurisch;Wieslaw Kubiak
Affiliations:
Institute of Computing Science, Technical University of Poznán, Poland;Faculty of Business Administration, Memorial University of Newfoundland, St. John's, Nfld., Canada;Faculty of Business Administration, Memorial University of Newfoundland, St. John's, Nfld., Canada
Venue:
Operations Research Letters
Year:
1994

Citing 2
Cited 4

Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times

Computers and Operations Research
Scheduling a two-stage flowshop under makespan constraint

Mathematical and Computer Modelling: An International Journal
A survey on offline scheduling with rejection

Journal of Scheduling
Enhancing local search algorithms for job shops with min-sum objectives by approximate move evaluation

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of scheduling jobs with a common due date d so that the weighted number of late jobs is minimized is considered for two machine open, flow, and job shops. NP-hardness proofs as well as optimization algorithms that run in time polynomial in d and the number of jobs are given for all three shop models.