Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
From MaRDI portal
Publication:1781549
DOI10.1016/j.cor.2004.04.001zbMath1071.90019OpenAlexW2117987000MaRDI QIDQ1781549
Michele E. Pfund, Hari Balasubramanian, Lars Mönch, John W. Fowler
Publication date: 27 June 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.04.001
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (33)
Construction of Schedules for the Performance of Task Packages in Multi-Stage Systems when Forming Sets of Results and Limitations ⋮ On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server ⋮ Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines ⋮ Job scheduling of diffusion furnaces in semiconductor fabrication facilities ⋮ A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time ⋮ Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling ⋮ Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops ⋮ A novel approach to hedge and compensate the critical dimension variation of the developed-and-etched circuit patterns for yield enhancement in semiconductor manufacturing ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times ⋮ Bicriteria scheduling problem for unrelated parallel machines with release dates ⋮ Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing ⋮ A batch-oblivious approach for complex job-shop scheduling problems ⋮ A genetic algorithm-based approach for single-machine scheduling with learning effect and release time ⋮ An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan ⋮ Metaheuristics for order scheduling problem with unequal ready times ⋮ Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates ⋮ A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes ⋮ A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines ⋮ Minimizing makespan for multi-spindle head machines with a mobile table ⋮ Online scheduling of incompatible unit-length job families with lookahead ⋮ Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes ⋮ Rule-based scheduling in wafer fabrication with due date-based objectives ⋮ Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing ⋮ A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival ⋮ Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times ⋮ Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery ⋮ A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times ⋮ Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
- Stochastic scheduling of a batch processing machine with incompatible job families
- A new dynamic look-ahead scheduling procedure for batching machines
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The use of upstream and downstream information in scheduling semiconductor batch operations
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
This page was built for publication: Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
