scientific article
From MaRDI portal
Publication:3197606
DOI<587::AID-NAV3220370411>3.0.CO;2-O 10.1002/1520-6750(199008)37:4<587::AID-NAV3220370411>3.0.CO;2-OzbMath0712.90032MaRDI QIDQ3197606
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
single machinetotal tardinessmaximum latenesstotal weighted tardinessnumber of late jobsgeneralized due datesparallel chain precedence constraints
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Single machine scheduling with assignable due dates, A single machine scheduling with generalized and periodic due dates to minimize total deviation, Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs, A greedy heuristic for solving scheduling problems with bounded rejection cost, Single machine scheduling with rejection and generalized parameters, A note: minmax due-date assignment problem with lead-time cost, Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals, Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty, Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity, Order acceptance and scheduling with delivery under generalized parameters, A note on the SPT heuristic for solving scheduling problems with generalized due dates, On the complexity of generalized due date scheduling problems, Two-agent single-machine scheduling with assignable due dates, Unary NP-hardness of minimizing total weighted tardiness with generalized due dates, Minimizing total late work on a single machine with generalized due-dates, Strong NP-hardness of minimizing total deviation with generalized and periodic due dates, Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty, Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates, Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates, On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates, Scheduling with generalized and periodic due dates under single- and two-machine environments
Cites Work
