Scheduling unit-time tasks in renewable resource constrained flowshops

DOI10.1007/BF01416242zbMATH Open0794.90026OpenAlexW2057399255MaRDI QIDQ4031376FDOQ4031376

Nesim Erkip, Suna Kondakci, Haldun Süral

Publication date: 1 April 1993

Published in: 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

Recommendations

• scientific article
• THE ASSIGNMENT OF INDIVIDUAL RENEWABLE RESOURCES IN SCHEDULING
• scientific article; zbMATH DE number 3987033
• Scheduling under a Non-renewable Resource Constraint
• Unit-time scheduling problems with time dependent resources
• Project Scheduling Under Partially Renewable Resource Constraints
• A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages
• Scheduling with non-renewable resources: minimizing the sum of completion times
• Uniform machine scheduling of unit-time jobs subject to resource constraints
• Job Shop Scheduling under a Non-Renewable Resource Constraint

zbMATH Keywords

makespanbranch-and-boundunit processing timetwo-machine flow shopmaximum completion timeresource constraintresource constrained flow shopthree- machine flow shop

Mathematics Subject Classification ID

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

Cites Work

• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
• Scheduling subject to resource constraints: Classification and complexity
• Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
• 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
• New directions in scheduling theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• THE POWER OF UPPER AND LOWER BOUNDING FUNCTIONS IN BRANCH-AND-BOUND ALGORITHMS

Cited In (9)

• Job shop scheduling with unit time operations under resource constraints and release dates
• Title not available (Why is that?)
• Flow shop scheduling problem with conflict graphs
• Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
• General flow-shop scheduling with resource constraints
• Flexible flow shop with dedicated buffers
• Title not available (Why is that?)
• Energy-aware production scheduling in the flow shop environment under sequence-dependent setup times, group scheduling and renewable energy constraints
• Two branch and bound algorithms for the permutation flow shop problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031376)