An extension of set partitioning with application to scheduling problems

DOI10.1016/0377-2217(85)90031-1zbMath0569.90063MaRDI QIDQ1060959

Kenneth Darby-Dowman, Gautam Mitra

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://bura.brunel.ac.uk/handle/2438/2158

zbMATH Keywords

goal programming; set packing; set covering; set partitioning; bus crew scheduling system; extended set partitioning; shortest route problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

90C10: Integer programming

90B35: Deterministic scheduling theory in operations research

Related Items

A model for bus crew scheduling problem with multiple duty types, Network models for vehicle and crew scheduling, An extension of set partitioning with application to scheduling problems, Graph theoretic relaxations of set covering and set partitioning problems, An intelligent system for US Coast Guard cutter scheduling, A review of goal programming and its applications, The column-circular, subsets-selection problem: Complexity and solutions, A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints, Integrated rolling stock deadhead routing and timetabling in urban rail transit lines

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• An extension of set partitioning with application to scheduling problems
• On a routing problem
• An Essay on Prime Implicant Tables
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• Set Partitioning: A survey
• Optimal Political Districting by Implicit Enumeration Techniques
• The Location of Emergency Service Facilities