Extensions of coloring models for scheduling purposes
type: Item
instance of: scholarly article
title: Extensions of coloring models for scheduling purposes
zbMATH Open document ID: 0914.90161
DOI: 10.1016/0377-2217(96)00013-6
author: Dominique De Werra
published in: European Journal of Operational Research
publication date: 1998-12-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1212254
zbMATH Keywords: chromatic scheduling
zbMATH Keywords: automated production systems
zbMATH Keywords: course timetabling
MaRDI profile type: Publication
full work available at URL: 0377-2217(96)00013-6
OpenAlex ID: W2097424969
cites work: Cyclic Scheduling via Integer Programs with Circular Ones
cites work: Q5615282
cites work: Balanced matrices
cites work: Q3821925
cites work: Q4023677
cites work: A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem
cites work: On cyclic sequence types for constructing cyclic schedules
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Q5604409
cites work: Q5514188
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Parallel concepts in graph theory
cites work: Two-Machine Open Shops with Renewable Resources
cites work: Some results concerning the complexity of restricted colorings of graphs
cites work: Interval edge coloring of a graph with forbidden colors
cites work: Open shop problem with zero-one time operations and integer release date/deadline intervals
cites work: Restrictions and preassignments in preemptive open shop scheduling
cites work: On the Flow-Shop Sequencing Problem with No Wait in Process†
cites work: Q5752591
cites work: Compact Cylindrical Chromatic Scheduling
cites work: Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
cites work: Edge-Chromatic Scheduling with Simultaneity Constraints
cites work: Some graph‐theoretical models for scheduling in automated production systems
cites work: Open shop scheduling with some additional constraints
Recommended article: Q5111006
Recommended article: Restricted coloring models for timetabling
Recommended article: Q2712373
Recommended article: Scheduling Problems and Mixed Graph Colorings
Recommended article: A graph coloring algorithm for large scale scheduling problems
Recommended article: Plurigraph coloring and scheduling problems
Recommended article: Q4411274
Recommended article: On a multiconstrained model for chromatic scheduling
Recommended article: Interval scheduling and colorful independent sets
description: scientific article; zbMATH DE number 1212254