Pages that link to "Item:Q1278296"
From MaRDI portal
The following pages link to A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs (Q1278296):
Displaying 13 items.
- An improved approximation algorithm for single machine scheduling with job delivery (Q621846) (← links)
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval (Q726392) (← links)
- A zero-inventory production and distribution problem with a fixed customer sequence (Q940901) (← links)
- Unbounded parallel batch scheduling with job delivery to minimize makespan (Q1003499) (← links)
- Machine scheduling with job delivery coordination (Q1876146) (← links)
- Coordinating multi-location production and customer delivery (Q1936790) (← links)
- Single machine scheduling with release dates and job delivery to minimize the makespan (Q2481956) (← links)
- Scheduling in a two-stage supply chain with uncertain parameters (Q2987882) (← links)
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN (Q3521606) (← links)
- Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations (Q5168017) (← links)
- Parallel-Machine Scheduling to Minimize Flowtime, Holding, and Batch Delivery Costs (Q5174414) (← links)
- A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan (Q5244301) (← links)
- Machine scheduling with transportation considerations (Q5932281) (← links)
