Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
type: Item
instance of: scholarly article
title: Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
zbMATH Open document ID: 0801.90061
DOI: 10.1016/0377-2217(94)90332-8
author: Claire Hanen
published in: European Journal of Operational Research
publication date: 1994-04-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 550256
zbMATH Keywords: pipelined architectures
zbMATH Keywords: cyclic scheduling
zbMATH Keywords: disjunctive resources
zbMATH Keywords: recurrent job-shop
zbMATH Keywords: NP-hard
zbMATH Keywords: mixed linear program
zbMATH Keywords: branch-and-bound
zbMATH Keywords: heuristics
describes a project that uses: PESPLib
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90332-8
OpenAlex ID: W2042541831
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: Un domaine très ouvert : les problèmes d'ordonnancement
cites work: Q3820002
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
cites work: Q4198056
cites work: Q3932272
cites work: Q3358512
cites work: Cyclic Schedules for Job Shops with Identical Jobs
cites work: A Mathematical Model for Periodic Scheduling Problems
description: scientific article; zbMATH DE number 550256