Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility
From MaRDI portal
Publication:490371
DOI10.1007/s10951-012-0308-7zbMath1305.90193OpenAlexW1965284921WikidataQ58759992 ScholiaQ58759992MaRDI QIDQ490371
Andrés L. Medaglia, Alvaro J. Lozano
Publication date: 22 January 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-012-0308-7
GRASPMILPincompatible product familiesparallel batch-processing machinessequence-dependent processing times
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel batch scheduling of equal-length jobs with release and due dates
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
- Scheduling on parallel identical machines to minimize total tardiness
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- On-line scheduling a batch processing system to minimize total weighted job completion time
- Batch-processing scheduling with setup times
- Greedy randomized adaptive search procedures
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- Scheduling with batching: A review
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
- Scheduling jobs on parallel machines to minimize a regular step total cost function
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility
