Pages that link to "Item:Q497629"

The following pages link to Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629):

Displaying 8 items.

• Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
• High-multiplicity scheduling on one machine with forbidden start and completion times (Q341471) (← links)
• A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
• Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval (Q726392) (← links)
• A lower bound for minimizing the total completion time of a three-agent scheduling problem (Q1671716) (← links)
• Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
• Two-machine flow shop scheduling with an operator non-availability period to minimize makespan (Q2175049) (← links)
• Single-machine scheduling with operator non-availability to minimize total weighted completion time (Q2195317) (← links)