scientific article; zbMATH DE number 10435
From MaRDI portal
Publication:4713573
DOI<333::AID-NAV3220380305>3.0.CO;2-0 10.1002/1520-6750(199106)38:3<333::AID-NAV3220380305>3.0.CO;2-0zbMath0747.90049MaRDI QIDQ4713573
No author found.
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
branch-and-bound algorithmsingle machinelower boundtotal weighted completion timeDominance rulesjob classesSet-up timesshortest weighted processing time
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs ⋮ Batch scheduling to minimize total completion time ⋮ An exact dynamic programming algorithm for the precedence-constrained class sequencing problem ⋮ A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness ⋮ Scheduling with batching: A review ⋮ Lower bounds and algorithms for flowtime minimization on a single machine with set-up times ⋮ Minimizing flowtime for paired tasks ⋮ Approximation algorithms for problems in scheduling with set-ups ⋮ Dynamic programming algorithms for scheduling parallel machines with family setup times ⋮ An online algorithm for a problem in scheduling with set-ups and release times ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ 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 ⋮ Heuristic methods for the identical parallel machine flowtime problem with set-up times ⋮ A heuristic approach for single-machine scheduling with due dates and class setups. ⋮ Two-machine flowshop scheduling with job class setups to minimize total flowtime ⋮ Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization ⋮ Online Machine Scheduling with Family Setups ⋮ An uncertain programming model for single machine scheduling problem with batch delivery ⋮ Single machine scheduling to minimize the setup time and the earliness ⋮ Using profit maximizing scheduling models to structure operational trade-offs and manufacturing strategy issues ⋮ Minimizing maximum lateness with job families
Cites Work
