A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
From MaRDI portal
Publication:5937715
DOI10.1016/S0377-2217(99)00415-4zbMath0983.90019WikidataQ126863058 ScholiaQ126863058MaRDI QIDQ5937715
George Steiner, Jinliang Cheng, Paul Stephenson
Publication date: 12 July 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Search theory (90B40) Deterministic scheduling theory in operations research (90B35)
Related Items (5)
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. ⋮ Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates ⋮ Permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm ⋮ An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
Cites Work
- Unnamed Item
- Unnamed Item
- Some efficient heuristic methods for the flow shop sequencing problem
- On lower bounds on the minimum maximum lateness on one machine subject to release date
- An adaptive branching rule for the permutation flow-shop problem
- On two-machine scheduling with release and due dates to minimize maximum lateness
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Two branch and bound algorithms for the permutation flow shop problem
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
- Benchmarks for basic scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- Minimising makespan in the two-machine flow-shop with release times
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
- Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Some simple scheduling algorithms
This page was built for publication: A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
