Pages that link to "Item:Q941536"
From MaRDI portal
The following pages link to A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times (Q941536):
Displaying 17 items.
- A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (Q298761) (← links)
- Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs (Q337279) (← links)
- Single machine batch scheduling with release times and delivery costs (Q398839) (← links)
- Single-machine batch scheduling minimizing weighted flow times and delivery costs (Q614457) (← links)
- An improved approximation algorithm for single machine scheduling with job delivery (Q621846) (← links)
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines (Q1617275) (← links)
- A knowledge-based approach for multi-factory production systems (Q1652022) (← links)
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs (Q1667779) (← links)
- Integrated production and delivery scheduling for multi-factory supply chain with stage-dependent inventory holding cost (Q1699357) (← links)
- Scheduling and common due date assignment on a single parallel-batching machine with batch delivery (Q1723354) (← links)
- Integrated scheduling of production and distribution for manufacturers with parallel batching facilities (Q1800447) (← links)
- Minimizing maximum tardiness and delivery costs with batch delivery and job release times (Q2282368) (← links)
- A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs (Q2370330) (← links)
- Coordination of production and transportation in supply chain scheduling (Q2514664) (← links)
- Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics (Q2669512) (← links)
- Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm (Q2795178) (← links)
- Preemptive scheduling in a two-stage supply chain to minimize the makespan (Q3458814) (← links)