Routing open shop and flow shop scheduling problems
From MaRDI portal
Publication:421573
DOI10.1016/J.EJOR.2011.02.028zbMath1237.90102OpenAlexW2011111461MaRDI QIDQ421573
Leiyang Wang, Zhaohui Liu, Wei Yu, Ti-Jun Fan
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.02.028
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A review on integrated scheduling and outbound vehicle routing problems ⋮ A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector ⋮ OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Completing Partial Schedules for Open Shop with Unit Processing Times and Routing
Cites Work
- Unnamed Item
- A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Vehicle scheduling on a tree with release and handling times
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
- A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
- Linear time approximation schemes for vehicle scheduling problems
- The routing open-shop problem on a network: complexity and approximation
- Optimal two- and three-stage production schedules with setup times included
- Single-vehicle scheduling problems with release and service times on a line
- Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
- Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times
- The complexity of the travelling repairman problem
- Special cases of traveling salesman and repairman problems with time windows
- Open Shop Scheduling to Minimize Finish Time
- Routing Two-Machine Flowshop Problems on Networks with Special Structure
- A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
This page was built for publication: Routing open shop and flow shop scheduling problems
