Job-shop scheduling with resource-time models of operations

DOI10.1016/0377-2217(87)90169-XzbMath0614.90048OpenAlexW2029823483MaRDI QIDQ1820680

Adam Janiak, Jozef Grabowski

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0377-2217(87)90169-x

zbMATH Keywords

branch-and-bound algorithmresource allocationjob-shop schedulingdisjunctive graphComputational experience

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Job-shop scheduling with convex models of operations, A survey of scheduling with controllable processing times, A survey of results for sequencing problems with controllable processing times, A multi-objective approach to resource allocation in single machine scheduling, Single machine scheduling problem with a common deadline and resource dependent release dates, Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis, Two-machine open shop problem with controllable processing times, Scheduling two agents with controllable processing times, KBSS: A knowledge-based system for scheduling in automated manufacturing, Minimization of the makespan in a two-machine problem under given resource constraints, An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times, An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times

Cites Work

• Unnamed Item
• Unnamed Item
• On two-machine scheduling with release and due dates to minimize maximum lateness
• Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
• Critical-Path Planning and Scheduling: Mathematical Basis
• On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
• Project Scheduling with Discrete and Continuous Resources
• Job-Shop Scheduling by Implicit Enumeration
• Discrete Programming by the Filter Method
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• A Direct Search Method to Locate Negative Cycles in a Graph