Pages that link to "Item:Q1310010"
From MaRDI portal
The following pages link to On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date (Q1310010):
Displayed 30 items.
- Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs (Q337279) (← links)
- 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)
- Batch sizing and just-in-time scheduling with common due date (Q744646) (← links)
- The coordination of scheduling and batch deliveries (Q816348) (← links)
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment (Q829197) (← links)
- Unbounded parallel batch scheduling with job delivery to minimize makespan (Q1003499) (← links)
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs (Q1268191) (← links)
- A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs (Q1278296) (← links)
- Scheduling with batch setup times and earliness-tardiness penalties (Q1278527) (← 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)
- Integrated production and delivery scheduling for multi-factory supply chain with stage-dependent inventory holding cost (Q1699357) (← links)
- Two-stage medical supply chain scheduling with an assignable common due window and shelf life (Q1740417) (← links)
- Machine scheduling with job delivery coordination (Q1876146) (← links)
- Simultaneous minimization of total completion time and total deviation of job completion times (Q1877049) (← links)
- Coordinating multi-location production and customer delivery (Q1936790) (← links)
- An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time (Q2084598) (← links)
- Single machine scheduling with release dates and job delivery to minimize the makespan (Q2481956) (← links)
- Logistics scheduling with batching and transportation (Q2482765) (← links)
- Integration of finished goods batch delivery into production scheduling via total tardiness minimization (Q3512025) (← links)
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN (Q3521606) (← links)
- Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem (Q5038175) (← 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)
- Parallel machine scheduling with a common due window (Q5953340) (← links)
- An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain (Q6091879) (← links)
- Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost (Q6105902) (← links)
- An improved memetic algorithm for integrated production scheduling and vehicle routing decisions (Q6109340) (← links)