Job Shop Scheduling under a Non-Renewable Resource Constraint

DOI10.1057/JORS.1994.146MaRDI QIDQ4305774zbMATH OpenOpenAlexFDO

Authors Aysegül Toker, Suna Kondakci, Nesim Erkip

Publication date 28 March 1995

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1994.146

zbMATH Keywords

approximation algorithmdiscrete non-renewable resource constraintjob shop schedulingminimum makespannon-renewable resource

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling under a Non-renewable Resource Constraint
• scientific article; zbMATH DE number 3882186
• Approximation schemes for single machine scheduling with non-renewable resource constraints
• Scheduling with non-renewable resources: minimizing the sum of completion times
• scientific article; zbMATH DE number 3887411

Cited in

(10)

• Resource-constrained job scheduling with recyclable resources
• Approximation schemes for parallel machine scheduling with non-renewable resources
• scientific article; zbMATH DE number 3882186 (Why is no real title available?)
• scientific article; zbMATH DE number 3887411 (Why is no real title available?)
• Scheduling under a Non-renewable Resource Constraint
• Scheduling unit-time tasks in renewable resource constrained flowshops
• Resource constraint scheduling with a fractional shared resource
• Job shop scheduling with delay-renewable resources: A comparison of decomposition strategies
• Reductions between scheduling problems with non-renewable resources and knapsack problems
• A job-shop problem with one additional resource type

This page was built for publication: Job Shop Scheduling under a Non-Renewable Resource Constraint

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