Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
type: Item
instance of: scholarly article
title: Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
zbMATH Open document ID: 1112.90023
author: Dorit S. Hochbaum
author: Asaf Levin
published in: Discrete Optimization
publication date: 2007-02-20T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5128391
zbMATH Keywords: multiple shift scheduling problem
zbMATH Keywords: cyclical scheduling
MaRDI profile type: Publication
full work available at URL: j.disopt.2006.02.002
OpenAlex ID: W2028181262
cites work: Q4737208
cites work: An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
cites work: Cyclic Scheduling via Integer Programs with Circular Ones
cites work: A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
cites work: Q4198056
cites work: A fast approximation algorithm for the multicovering problem
cites work: Convex separable optimization is not much harder than linear optimization
cites work: Minimax problems with bitonic matrices
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: Maximum matching of given weight in complete and complete bipartite graphs
cites work: Multiple Shift Workforce Lower Bounds
cites work: Q3732972
cites work: COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING
cites work: On the hardness of approximating minimization problems
cites work: Matching is as easy as matrix inversion
cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Optimal Capacity Scheduling—I
cites work: Q3802875
cites work: Matchings in colored bipartite networks
DOI: 10.1016/J.DISOPT.2006.02.002
description: scientific article; zbMATH DE number 5128391