scientific article
From MaRDI portal
Publication:3989986
DOI<369::AID-NAV3220390307>3.0.CO;2-F 10.1002/1520-6750(199204)39:3<369::AID-NAV3220390307>3.0.CO;2-FzbMath0745.90042MaRDI QIDQ3989986
Louis A. Martin-Vega, Chung-Yee Lee, Reha Uzsoy
Publication date: 28 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
heuristicssingle-machine schedulingsequence-dependent setup timesmaximum latenessworst-case error boundsemiconductor test operations
Related Items
Preemptive scheduling with release dates, delivery times and sequence independent setup times ⋮ Scheduling of multi-spindle CNC gantry mills ⋮ A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan ⋮ Minimizing makespan on parallel machines with release time and machine eligibility restrictions ⋮ A sequencing problem with family setup times ⋮ Semiconductor final-test scheduling under setup operator constraints ⋮ Single-machine scheduling problems with past-sequence-dependent setup times ⋮ Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis ⋮ Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times ⋮ In-house development of scheduling decision support systems: case study for scheduling semiconductor device test operations ⋮ Heuristics for capacity planning problems with congestion ⋮ Scheduling of wafer test processes in semiconductor manufacturing ⋮ A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
Cites Work
