Pages that link to "Item:Q1003499"
From MaRDI portal
The following pages link to Unbounded parallel batch scheduling with job delivery to minimize makespan (Q1003499):
Displaying 13 items.
- Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing (Q342170) (← links)
- Unbounded parallel-batch scheduling with family jobs and delivery coordination (Q1944952) (← links)
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing (Q2026991) (← links)
- Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery (Q2039713) (← links)
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
- Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery (Q2176828) (← links)
- Integrated production and delivery scheduling on a serial batch machine to minimize the makespan (Q2257290) (← links)
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time (Q2342682) (← links)
- On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time (Q2434291) (← links)
- Integrated scheduling problem on a single bounded batch machine with an unavailability constraint (Q2657417) (← links)
- Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time (Q2676295) (← links)
- Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations (Q5168017) (← links)
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time (Q5964074) (← links)
