Pages that link to "Item:Q2563922"

The following pages link to Batch scheduling and common due-date assignment on a single machine (Q2563922):

Displaying 15 items.

• Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized (Q360482) (← links)
• A lower bound for weighted completion time variance (Q613431) (← links)
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
• Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
• Two due date assignment problems in scheduling a single machine (Q867932) (← links)
• Optimal due date assignment and resource allocation in a group technology scheduling environment (Q991385) (← links)
• Batch scheduling and common due date assignment problem: An NP-hard case (Q1382284) (← 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)
• Scheduling with batching: A review (Q1969826) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
• Due date assignments and scheduling a single machine with a general earliness/tardiness cost function (Q2459388) (← links)
• Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)