An approximation algorithm for the license and shift class design problem-Reference-Cited by-同舟云学术

An approximation algorithm for the license and shift class design problem

Published:1994-02 Issue:1 Volume:73 Page:127-131
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Jansen Klaus

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference11 articles.

1. A greedy heuristic for the set covering problem;Chvatal;Mathematics of Operations Research,1979

2. Minimizing the number of tankers to meet a fixed schedule;Dantzig;Naval Research Logistics Quarterly,1954

3. Interval scheduling with processors of two types;Doneti;Operations Research,1992

4. Minimal resources for fixed and variable job schedules;Gertsbakh;Operations Research,1978

5. An optimal solution to the channel assignment problem;Gupta;IEEE Transactions on Computers,1979

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Effects of Shift Generation on Staff Rostering;Dynamics of Information Systems;2023-12-28

2. Finding Optimum Solutions to the Shift Minimization Personnel Task Scheduling Problem With a New Pack-based Approach;2023 8th International Conference on Mathematics and Computers in Sciences and Industry (MCSI);2023-10-14

3. Optimal interval scheduling with nonidentical given machines;Cluster Computing;2019-01-28

4. A greedy heuristic for shift minimization personnel task scheduling problem;Computers & Operations Research;2018-12

5. A Hill Climbing Algorithm for Ground Station Scheduling;Lecture Notes in Electrical Engineering;2013