Study of a NP-hard cyclic scheduling problem: The recurrent job-shop

DOI10.1016/0377-2217(94)90332-8zbMath0801.90061OpenAlexW2042541831MaRDI QIDQ1319564

Claire Hanen

Publication date: 12 April 1994

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90332-8

zbMATH Keywords

heuristicsbranch-and-boundNP-hardcyclic schedulingpipelined architecturesdisjunctive resourcesmixed linear programrecurrent job-shop

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (24)

Using timed Petri net to model instruction-level loop scheduling with resource constraints ⋮ A study of the cyclic scheduling problem on parallel processors ⋮ Converging to periodic schedules for cyclic scheduling problems with resources and deadlines ⋮ A branch and bound algorithm for the cyclic job-shop problem with transportation ⋮ A fluid approach to large volume job shop scheduling ⋮ Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints ⋮ Grouping tasks to save energy in a cyclic scheduling problem: a complexity study ⋮ Tabu search algorithms for cyclic machine scheduling problems ⋮ A constraint programming model for the scheduling and workspace layout design of a dual-arm multi-tool assembly robot ⋮ The robust cyclic job shop problem ⋮ A cyclic scheduling problem with an undetermined number of parallel identical processors ⋮ A mixed integer programming model for the cyclic job-shop problem with transportation ⋮ Construction of cyclic schedules in presence of parallel machines ⋮ CROSS cyclic resource-constrained scheduling solver ⋮ A robust basic cyclic scheduling problem ⋮ Cyclic job shop scheduling problems with blocking ⋮ A general model for cyclic machine scheduling problems ⋮ An algorithm for the maximum revenue jobshop problem ⋮ Efficient scheduling of periodic information monitoring requests ⋮ Scheduling jobshops with some identical or similar jobs ⋮ A sufficient condition for the liveness of weighted event graphs ⋮ The complexity of a cyclic scheduling problem with identical machines and precedence constraints ⋮ On scheduling cycle shops: Classification, complexity and approximation ⋮ The complexity of cyclic shop scheduling problems

Uses Software

• PESPLib

Cites Work

• A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A Mathematical Model for Periodic Scheduling Problems
• An Algorithm for Solving the Job-Shop Problem
• Un domaine très ouvert : les problèmes d'ordonnancement
• Cyclic Schedules for Job Shops with Identical Jobs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Study of a NP-hard cyclic scheduling problem: The recurrent job-shop