Pages that link to "Item:Q1029329"
From MaRDI portal
The following pages link to A new heuristic algorithm for the machine scheduling problem with job delivery coordination (Q1029329):
Displaying 17 items.
- Two parallel machines problem with job delivery coordination and availability constraint (Q256680) (← links)
- An improved two-machine flowshop scheduling with intermediate transportation (Q266074) (← links)
- Heuristics for parallel machine scheduling with batch delivery consideration (Q380563) (← links)
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination (Q387811) (← links)
- Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling (Q2009683) (← links)
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing (Q2026991) (← links)
- A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) (Q2084601) (← links)
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
- Two parallel machines scheduling with two-vehicle job delivery to minimize makespan (Q2296256) (← links)
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time (Q2342682) (← links)
- Preemptive scheduling in a two-stage supply chain to minimize the makespan (Q3458814) (← links)
- SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK (Q4921478) (← links)
- PARALLEL MACHINE SCHEDULING WITH JOB DELIVERY COORDINATION (Q5370785) (← links)
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time (Q5964074) (← links)
- Flow shop scheduling problems with transportation constraints revisited (Q6185848) (← links)
- An improved approximation algorithm for a scheduling problem with transporter coordination (Q6204661) (← links)