Impact of sequence-dependent setup time on job shop scheduling performance
From MaRDI portal
Publication:4394289
DOI10.1080/00207549408957019zbMath0901.90130OpenAlexW2022047536MaRDI QIDQ4394289
No author found.
Publication date: 11 June 1998
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207549408957019
Related Items
A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness ⋮ A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness ⋮ Optimization of setup times in the furniture industry ⋮ Algorithms for single machine total tardiness scheduling with sequence dependent setups ⋮ A framework for integration of production management issues and concurrent engineering ⋮ A branch and bound method for the job-shop problem with sequence-dependent setup times ⋮ Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times ⋮ A quantitative approach for scheduling activities to reduce set-up in multiple machine lines ⋮ Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times ⋮ Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times ⋮ A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times ⋮ Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Power Function Charts for Specifying Numbers of Observations in Analyses of Variance of Fixed Effects
- Some Optimum Algorithms for Scheduling Problems with Changeover Costs
- Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
- Balancing Workloads and Minimizing Set-up Costs in the Parallel Processing Shop
- A Production Scheduling Problem with Sequencing Considerations
- A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- Minimum Change-Over Scheduling of Several Products on One Machine
- Sequencing many jobs on a multi-purpose facility
- Optimum Production Scheduling of Multicommodity in Flow Line
