Scheduling unit-time tasks in renewable resource constrained flowshops

DOI10.1007/BF01416242zbMath0794.90026OpenAlexW2057399255MaRDI QIDQ4031376

Nesim Erkip, Suna Kondakci, Haldun Süral

Publication date: 1 April 1993

Published in: [https://portal.mardi4nfdi.de/entity/Q3199221 ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01416242

zbMATH Keywords

branch-and-boundmakespanmaximum completion timeresource constraintunit processing timetwo-machine flow shopresource constrained flow shopthree- machine flow shop

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph ⋮ Flexible flow shop with dedicated buffers ⋮ Flow shop scheduling problem with conflict graphs ⋮ Two branch and bound algorithms for the permutation flow shop problem

Cites Work

• Unnamed Item
• Unnamed Item
• New directions in scheduling theory
• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
• Scheduling subject to resource constraints: Classification and complexity
• Resource constrained scheduling as generalized bin packing
• Some new results in flow shop scheduling
• Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
• Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
• THE POWER OF UPPER AND LOWER BOUNDING FUNCTIONS IN BRANCH-AND-BOUND ALGORITHMS

This page was built for publication: Scheduling unit-time tasks in renewable resource constrained flowshops