Pages that link to "Item:Q1175769"

The following pages link to On the complexity of generalized due date scheduling problems (Q1175769):

Displaying 29 items.

• Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs (Q293435) (← links)
• A note: minmax due-date assignment problem with lead-time cost (Q336460) (← links)
• Performance guarantees for a scheduling problem with common stepwise job payoffs (Q476886) (← links)
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
• Minimizing late jobs in the general one machine scheduling problem (Q1130035) (← links)
• A note on the SPT heuristic for solving scheduling problems with generalized due dates (Q1433162) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Single machine scheduling with assignable due dates (Q1613425) (← links)
• Unary NP-hardness of minimizing total weighted tardiness with generalized due dates (Q1785477) (← links)
• Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
• Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty (Q2045022) (← links)
• Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
• On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (Q2093185) (← links)
• Scheduling with generalized and periodic due dates under single- and two-machine environments (Q2115317) (← links)
• A single machine scheduling with generalized and periodic due dates to minimize total deviation (Q2127609) (← links)
• A greedy heuristic for solving scheduling problems with bounded rejection cost (Q2147117) (← links)
• Single machine scheduling with rejection and generalized parameters (Q2149874) (← links)
• Strong NP-hardness of minimizing total deviation with generalized and periodic due dates (Q2294353) (← links)
• Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates (Q2352264) (← links)
• Scheduling with due date assignment under special conditions on job processing (Q2434296) (← links)
• Single machine scheduling with delivery dates and cumulative payoffs (Q2434318) (← links)
• Batch scheduling of deteriorating reworkables (Q2482803) (← links)
• A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches (Q3163273) (← links)
• (Q3197606) (← links)
• Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals (Q4561184) (← links)
• Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates (Q5216799) (← links)
• Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty (Q6094564) (← links)
• Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity (Q6109346) (← links)
• Order acceptance and scheduling with delivery under generalized parameters (Q6179281) (← links)