Pages that link to "Item:Q1613425"

The following pages link to Single machine scheduling with assignable due dates (Q1613425):

Displaying 30 items.

• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• A note: minmax due-date assignment problem with lead-time cost (Q336460) (← links)
• Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times (Q340332) (← links)
• Two due date assignment problems in scheduling a single machine (Q867932) (← links)
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
• The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
• Survey of scheduling research involving due date determination decisions (Q1111925) (← 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)
• Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
• A greedy heuristic for solving scheduling problems with bounded rejection cost (Q2147117) (← links)
• Two-agent single-machine scheduling with assignable due dates (Q2250186) (← links)
• Strong NP-hardness of minimizing total deviation with generalized and periodic due dates (Q2294353) (← links)
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← links)
• Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates (Q2352264) (← links)
• Job sequencing and due date assignment in a single machine shop with uncertain processing times (Q2383106) (← links)
• Batch scheduling of deteriorating reworkables (Q2482803) (← links)
• Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work (Q2673557) (← links)
• TWK due date determination and scheduling: NP-hardness and polynomially solvable case (Q2784173) (← links)
• (Q3131408) (← links)
• Scheduling with Fixed Delivery Dates (Q3634987) (← links)
• Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals (Q4561184) (← links)
• Single Facility Due Date Setting with Multiple Customer Classes (Q4859332) (← links)
• Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates (Q5216799) (← links)
• Fabrication scheduling on a single machine with due date constraints (Q5955094) (← links)
• Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time (Q5964074) (← links)
• Maximizing total early work in a distributed two‐machine flow‐shop (Q6078603) (← links)
• Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity (Q6109346) (← links)
• Single machine scheduling with assignable due dates to minimize maximum and total late work (Q6167395) (← links)
• Order acceptance and scheduling with delivery under generalized parameters (Q6179281) (← links)