scientific article; zbMATH DE number 10435
From MaRDI portal
Publication:4713573
Recommendations
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
- Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
- A New Heuristic for a Single Machine Scheduling Problem with Set-up Times
- Scheduling parallel machines to minimize weighted flowtime with family set-up times
- Two-machine flowshop scheduling with job class setups to minimize total flowtime
Cited in
(33)- Single facility scheduling with multiple job classes
- Scheduling two job classes on a single machine
- Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
- Single facility scheduling with major and minor setups
- Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
- Minimizing maximum lateness with job families
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- Minimizing flowtime for paired tasks
- Robust scheduling on a single machine to minimize total flow time
- Heuristic methods for the identical parallel machine flowtime problem with set-up times
- Scheduling a single machine to minimize a regular objective function under setup constraints
- Two-machine flowshop scheduling with job class setups to minimize total flowtime
- Batch scheduling to minimize total completion time
- Scheduling with batching: A review
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- An uncertain programming model for single machine scheduling problem with batch delivery
- A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs
- Approximation algorithms for problems in scheduling with set-ups
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Batch scheduling in a two-level supply chain -- a focus on the supplier
- Using profit maximizing scheduling models to structure operational trade-offs and manufacturing strategy issues
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
- Online machine scheduling with family setups
- Single machine scheduling to minimize the setup time and the earliness
- A New Heuristic for a Single Machine Scheduling Problem with Set-up Times
- Minimizing flow time in a flow-line manufacturing cell with family setup times
- An online algorithm for a problem in scheduling with set-ups and release times
- Minimizing Maximum Flow-time on Related Machines
- Minimizing sum of completion times on a single machine with sequence-dependent family setup times
- Dynamic programming algorithms for scheduling parallel machines with family setup times
- A heuristic approach for single-machine scheduling with due dates and class setups.
- On the integration of reinforcement learning and simulated annealing for the parallel batch scheduling problem with setups
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4713573)