Return to search

Staff scheduling by network programming.

by Kenneth Wing Chung Tang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1995. / Includes bibliographical references (leaves 64-65). / LIST OF TABLES --- p.vi / LIST OF FIGURES --- p.vii / Chapter 1. --- INTRODUCTION --- p.1 / Chapter 1.1 --- Staff Scheduling Overview --- p.2 / Chapter 1.1.1 --- Days-off scheduling --- p.7 / Chapter 1.1.2 --- Shift Scheduling --- p.8 / Chapter 1.1.3 --- Tour Scheduling --- p.9 / Chapter 1.2 --- Outline of The Work of The Thesis --- p.11 / Chapter 2. --- NETWORK MODEL FOR STAFF SCHEDULING --- p.13 / Chapter 2.1 --- The Basic Network Model --- p.13 / Chapter 2.1.1 --- General Idea --- p.13 / Chapter 2.1.2 --- Modeling Precedent Relationship Constraints by Arcs --- p.15 / Chapter 2.1.3 --- Modeling Shift Stretch Constraints by Nodes --- p.16 / Chapter 2.1.4 --- Modeling to Handle Side Constraints --- p.17 / Chapter 2.1.5 --- Mathematical Model --- p.21 / Chapter 2.2 --- Solving The Network Model With Side Constraints --- p.23 / Chapter 2.2.1 --- Basis Partitioning Network Simplex method --- p.23 / Chapter 2.2.2 --- A Two-Phase Heuristic for Schedules Construction --- p.29 / Chapter 3. --- APPLICA TION IN AN AIR CARGO TERMINAL --- p.55 / Chapter 3.1 --- Background And Problem Statement --- p.35 / Chapter 3.2 --- Generation of Staff Requirement Patterns --- p.38 / Chapter 3.3 --- A Typical Setting of Parameters --- p.41 / Chapter 3.4 --- Case One: Staff Requirement for Each Shift Is Fixed --- p.43 / Chapter 3.4.1 --- Conversion of hourly requirements to shift requirements --- p.43 / Chapter 3.4.2 --- Network Modeling --- p.44 / Chapter 3.4.3 --- An Example --- p.47 / Chapter 3.4.4 --- Computational result on different staff requirements --- p.49 / Chapter 3.5 --- Case Two: Staff Requirement for Each Shift Is Changing --- p.50 / Chapter 3.5.1 --- Network modeling --- p.51 / Chapter 3.5.2 --- An Example --- p.52 / Chapter 3.5.2.1 --- Overlapping shifts with one kind of break times --- p.54 / Chapter 3.5.2.2 --- Overlapping shifts with two kinds of break times --- p.56 / Chapter 3.5.2.3 --- Overtime work --- p.57 / Chapter 3.5.3 --- Computational results on different staff requirement patterns --- p.60 / Chapter 4. --- CONCLUSION --- p.62 / Chapter 5. --- BIBLIOGRAPHY --- p.64 / Chapter 6. --- APPENDIX --- p.66 / Chapter 6.1 --- Applying the heuristic to complete the incomplete schedules --- p.66 / Chapter 6.2 --- List of Schedules --- p.68 / Chapter 6.2.1 --- Terminologies --- p.68 / Chapter 6.2.2 --- The Optimal Schedules for Case One --- p.69 / Chapter 6.2.3 --- The Optimal Schedules for Case Two --- p.70 / Chapter 6.2.4 --- The Optimal Schedules with One-hour Break in One Shift --- p.71 / Chapter 6.2.5 --- The Optimal Schedules with Breaks after 4 and 3 Hours of Work --- p.72 / Chapter 6.2.6 --- The Optimal Schedules with Overtime Shifts --- p.73

Identiferoai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_320649
Date January 1995
ContributorsTang, Kenneth Wing Chung., Chinese University of Hong Kong Graduate School. Division of Systems Engineering and Engineering Management.
PublisherChinese University of Hong Kong
Source SetsThe Chinese University of Hong Kong
LanguageEnglish
Detected LanguageEnglish
TypeText, bibliography
Formatprint, vii, 74 leaves : ill. ; 30 cm.
RightsUse of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Page generated in 0.0018 seconds