Solving the selective multi-category parallel-servicing problem

DOI10.1007/s10951-013-0353-xzbMath1312.90022OpenAlexW1971252718MaRDI QIDQ2341388

Yanyan Li

Publication date: 24 April 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/1a7ff569-1e07-4543-ac80-da11769728fa

zbMATH Keywords

machine schedulingdynamic programmingpreprocessingnode-disjoint shortest path problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

A column generation approach for solving the patient admission scheduling problem

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The time-dependent prize-collecting arc routing problem
• A minimal algorithm for the multiple-choice knapsack problem
• Measuring instance difficulty for combinatorial optimization problems
• Tight compact models and comparative analysis for the prize collecting Steiner tree problem
• A column generation approach for solving the patient admission scheduling problem
• Resource extension functions: properties, inversion, and generalization to segments
• Privatized rural postman problems
• A Linear Programming Approach to the Cutting-Stock Problem
• A quick method for finding shortest pairs of disjoint paths
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• The Complexity of Flowshop and Jobshop Scheduling
• Solving Parallel Machine Scheduling Problems by Column Generation
• Shortest Path Problems with Resource Constraints
• Graph-Theoretic Concepts in Computer Science