Scheduling dedicated jobs with variative processing times

DOI10.1007/s10878-014-9787-0zbMath1339.90125OpenAlexW2088650722MaRDI QIDQ5963650

Erwin Pesch, Yakov M. Shafransky, Maksim Barketau

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9787-0

zbMATH Keywords

bipartite graphinteger linear programmingNP-hardnessmaximal matchingrail-rail yard

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Solving the single crane scheduling problem at rail transshipment yards

Uses Software

• CPLEX

Cites Work

• Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
• Scheduling co-operating stacking cranes with predetermined container sequences
• Determining crane areas in intermodal transshipment yards: the yard partition problem
• Assignment Problems
• Unnamed Item
• Unnamed Item