Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem

DOI10.1016/S0166-218X(99)00165-1MaRDI QIDQ1962067zbMATH OpenWikidataFDO

Authors Svetlana A. Kravchenko

Publication date 30 January 2000

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

job-shoppseudo-polynomial algorithm\(NP\)-hard problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Two-machine flowshop scheduling to minimize the number of tardy jobs
• Two-machine flow-shop scheduling to minimize total late work: revisited
• Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
• Minimizing late jobs in the general one machine scheduling problem
• Minimizing the number of tardy jobs in two-machine settings with common due date
• Minimising Maximum Lateness in a Two-Machine Flowshop
• Single machine scheduling with two job classes : minimizing maximum lateness
• Two-machine flowshop scheduling to minimize total tardiness
• On the complexity of minimizing the number of late jobs in unit time open shop
• An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system

Cites work

• scientific article; zbMATH DE number 3970499 (Why is no real title available?)
• scientific article; zbMATH DE number 3759900 (Why is no real title available?)
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
• An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
• An efficient algorithm for a job shop problem
• Computational Complexity of Discrete Optimization Problems
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Is a unit-job shop not easier than identical parallel machines?
• Minimizing maximum lateness in a two-machine unit-time job shop
• Reducibility among combinatorial problems
• Total completion time minimization in two-machine job shops with unit-time operations

Cited in

(11)

• scientific article; zbMATH DE number 4001854 (Why is no real title available?)
• Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
• Parameterized complexity of machine scheduling: 15 open problems
• Is a unit-job shop not easier than identical parallel machines?
• On the complexity of minimizing the number of late jobs in unit time open shop
• A note on the two machine job shop with the weighted late work criterion
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• On scheduling cycle shops: Classification, complexity and approximation
• Minimizing the weighted number of tardy jobs on multiple machines: a review
• Scheduling shops to minimize the weighted number of late jobs
• Scheduling equal processing time jobs to minimize the weighted number of late jobs

This page was built for publication: Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962067)