An extension of set partitioning with application to scheduling problems

DOI10.1016/0377-2217(85)90031-1zbMath0569.90063OpenAlexW1999775499MaRDI 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 programmingset packingset coveringset partitioningbus crew scheduling systemextended set partitioningshortest route problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

A review of goal programming and its applications ⋮ Graph theoretic relaxations of set covering and set partitioning problems ⋮ An intelligent system for US Coast Guard cutter scheduling ⋮ 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 ⋮ A model for bus crew scheduling problem with multiple duty types ⋮ Integrated rolling stock deadhead routing and timetabling in urban rail transit lines ⋮ Network models for vehicle and crew scheduling ⋮ An extension of set partitioning with application to scheduling problems

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: An extension of set partitioning with application to scheduling problems