Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility
From MaRDI portal
(Redirected from Publication:490371)
Recommendations
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- Multiobjective scheduling of jobs with incompatible families on parallel batch machines
- Heuristic scheduling of jobs on a multi-product batch processing machine
Cites work
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Approximation algorithms for NP-hard problems.
- Batch-processing scheduling with setup times
- Greedy randomized adaptive search procedures
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 51430 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1452992 (Why is no real title available?)
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- Minimizing Total Tardiness on One Machine is NP-Hard
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- On-line scheduling a batch processing system to minimize total weighted job completion time
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel batch scheduling of equal-length jobs with release and due dates
- Scheduling jobs on parallel machines to minimize a regular step total cost function
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
- Scheduling on parallel identical machines to minimize total tardiness
- Scheduling with batching: A review
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
Cited in
(7)- Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times
- A heuristic to schedule flexible job-shop in a glass factory
- A systematic approach to quality oriented product sequencing for multistage manufacturing systems
- Multiproduct batching and scheduling with buffered rework: the case of a car paint shop
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
- A hybrid genetic algorithm based on reinforcement learning for the energy-aware production scheduling in the photovoltaic glass industry
- Scheduling heating tasks on parallel furnaces with setup times and conflicts
This page was built for publication: Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490371)
