Pages that link to "Item:Q4671312"
From MaRDI portal
The following pages link to Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families (Q4671312):
Displaying 26 items.
- Integrated production and delivery on parallel batching machines (Q320081) (← links)
- Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← links)
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
- A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival (Q991390) (← links)
- Order acceptance using genetic algorithms (Q1000954) (← links)
- Stochastic scheduling of a batch processing machine with incompatible job families (Q1374434) (← links)
- Integrated production and transportation on parallel batch machines to minimize total weighted delivery time (Q1628115) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- MILP models to minimise makespan in additive manufacturing machine scheduling problems (Q1722963) (← links)
- Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (Q1734827) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families (Q2158015) (← links)
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan (Q2268765) (← links)
- Scheduling on a batch processing machine with split compatibility graphs (Q2583507) (← links)
- Modelling and analysis of a multi-stage system involving batch processors with incompatible job families (Q2627422) (← links)
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems (Q2668700) (← links)
- Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
- PSBS: Practical Size-Based Scheduling (Q2985398) (← links)
- An effective formulation for optimal scheduling of multistage multi-product batch plant based on due dates (Q3163750) (← links)
- Scheduling batch processing machines with incompatible job families (Q4399080) (← links)
- Exact algorithms for scheduling multiple families of jobs on parallel machines (Q4456097) (← links)
- Integrated scheduling on parallel batch processing machines with non-identical capacities (Q5059346) (← links)
- Dynamic scheduling of batch-processing machines with non-identical product sizes (Q5438667) (← links)
- Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components (Q6135731) (← links)