Pages that link to "Item:Q976033"
From MaRDI portal
The following pages link to A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033):
Displayed 16 items.
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
- Tactical fixed job scheduling with spread-time constraints (Q337014) (← links)
- Algorithms and implementation of a set partitioning approach for modular machining line design (Q339661) (← links)
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407) (← links)
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system (Q1652207) (← links)
- Quality assurance laboratory planning system to maximize worker preference subject to certification and preference balance constraints (Q1652302) (← links)
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
- Integrated scheduling of production and distribution for manufacturers with parallel batching facilities (Q1800447) (← links)
- A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
- Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs (Q2027084) (← links)
- Column generation for minimizing total completion time in a parallel-batching environment (Q2066680) (← links)
- Exact algorithms to minimize makespan on single and parallel batch processing machines (Q2183850) (← links)
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time (Q2184132) (← links)
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines (Q2297575) (← links)
- Minimising makespan for two batch-processing machines with non-identical job sizes in job shop (Q2935125) (← links)
- Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes (Q5172586) (← links)