Pages that link to "Item:Q693407"
From MaRDI portal
The following pages link to Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407):
Displaying 27 items.
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes (Q336679) (← links)
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizes (Q1029348) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
- Minimizing total completion time of batch scheduling with nonidentical job sizes (Q1699779) (← links)
- Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems (Q1988965) (← links)
- Uniform parallel machine scheduling with resource consumption constraint (Q2009726) (← links)
- Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration (Q2022187) (← links)
- Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
- Exact algorithms to minimize makespan on single and parallel batch processing machines (Q2183850) (← links)
- Scheduling jobs with sizes and delivery times on identical parallel batch machines (Q2202014) (← links)
- Parallel machine scheduling with tool loading (Q2290906) (← links)
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines (Q2297575) (← links)
- An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems (Q2312337) (← links)
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times (Q2628197) (← links)
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems (Q2668700) (← links)
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
- Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time (Q2676295) (← links)
- Minimizing total completion time on a batching machine with job processing time compatibilities (Q2861568) (← links)
- Minimising makespan for two batch-processing machines with non-identical job sizes in job shop (Q2935125) (← links)
- Algorithms for scheduling on parallel batch machines with non-identical capacities and non-identical job sizes (Q2992407) (← links)
- A Novel Matrix Approach to Determine Makespan for Zero-Wait Batch Processes (Q3606053) (← links)
- On minimizing the makespan when some jobs cannot be assigned on the same machine (Q5111718) (← links)
- Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes (Q5172586) (← links)
- A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines (Q5963694) (← links)
