Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
From MaRDI portal
Publication:693407
DOI10.1016/J.APM.2011.09.061zbMATH Open1252.90022OpenAlexW2026422974MaRDI QIDQ693407FDOQ693407
Authors: Bo Chen, Ba-Yi Cheng, Shan-Lin Yang, Xiao-xuan Hu 
Publication date: 7 December 2012
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.09.061
Recommendations
- Parallel-machine batch scheduling with non-identical job sizes
- Scheduling parallel batch processing machines with non-identical job sizes
- Minimizing total completion time of batch scheduling with nonidentical job sizes
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Scheduling a single batch processing machine with non-identical job sizes
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
- Genetic algorithms to minimize the weighted number of late jobs on a single machine.
Cited In (33)
- Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems
- Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
- Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
- Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time
- Minimizing total completion time of batch scheduling with nonidentical job sizes
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration
- Uniform parallel machine scheduling with resource consumption constraint
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Parallel machine scheduling with tool loading
- Minimizing total completion time on a batching machine with job processing time compatibilities
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach
- Batch scheduling of nonidentical job sizes with minsum criteria
- An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems
- A new MIP model for parallel-batch scheduling with non-identical job sizes
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Parallel-machine batch scheduling with non-identical job sizes
- Algorithms for scheduling on parallel batch machines with non-identical capacities and non-identical job sizes
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- Scheduling parallel batch processing machines with non-identical job sizes
- On minimizing the makespan when some jobs cannot be assigned on the same machine
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Two-customer parallel batch processing machines with non-identical job sizes
- A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines
- A Novel Matrix Approach to Determine Makespan for Zero-Wait Batch Processes
This page was built for publication: Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693407)
