The complexity of a cyclic scheduling problem with identical machines and precedence constraints
type: Item
instance of: scholarly article
title: The complexity of a cyclic scheduling problem with identical machines and precedence constraints
zbMATH Open document ID: 0924.90095
DOI: 10.1016/0377-2217(95)00110-7
author: K. Appert
published in: European Journal of Operational Research
publication date: 1996-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1252854
zbMATH Keywords: cyclic scheduling
zbMATH Keywords: computational analysis
zbMATH Keywords: optimization
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00110-7
OpenAlex ID: W2077238477
cites work: Un domaine très ouvert : les problèmes d'ordonnancement
cites work: Optimal scheduling for two-processor systems
cites work: Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
cites work: A study of the cyclic scheduling problem on parallel processors
cites work: An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
cites work: The complexity of scheduling jobs in repetitive manufacturing systems
cites work: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
cites work: Q3358512
cites work: Scheduling Sequential Loops on Parallel Processors
cites work: Cyclic Schedules for Job Shops with Identical Jobs
description: scientific article; zbMATH DE number 1252854