Network flow approaches to pre-emptive open-shop scheduling problems with time-windows

DOI10.1016/j.ejor.2005.01.062zbMath1103.90048MaRDI QIDQ2503223

Yanyan Li

Publication date: 14 September 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.01.062

zbMATH Keywords

scheduling problem; time-windows; Max-flow parametrical algorithm; network flow approach; pre-emptive open-shop

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B35: Deterministic scheduling theory in operations research

90B10: Deterministic network models in operations research

Related Items

Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs, Shortest path problems with left-side time windows, A solution approach to find the critical path in a time-constrained activity network, A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows, A survey on scheduling problems with due windows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A parametric maximum flow algorithm for bipartite graphs with applications
• Scheduling jobs to minimize total cost
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Open Shop Scheduling to Minimize Finish Time
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Fast Parametric Maximum Flow Algorithm and Applications
• Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
• Scheduling Jobs on Several Machines with the Job Splitting Property