An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines
From MaRDI portal
Publication:5194747
DOI10.1002/nav.21863zbMath1421.90066OpenAlexW2963491949WikidataQ127455242 ScholiaQ127455242MaRDI QIDQ5194747
Xiaoyun Xiong, Cheng, T. C. Edwin, Yunqiang Yin, Deng-Feng Li, Peng Zhou
Publication date: 17 September 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21863
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
Related Items (8)
A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production ⋮ Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time, Learning Effect, Processing Cost and Machine Eligibility ⋮ A branch‐and‐price approach to the multitasking scheduling with batch control on parallel machines ⋮ Efficient algorithms for flexible job shop scheduling with parallel machines ⋮ A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones ⋮ TOPSIS method for teaching effect evaluation of College English with interval-valued intuitionistic fuzzy information ⋮ Due-window assignment scheduling with learning and deterioration effects ⋮ Two-machine flow shop scheduling with a common due date to maximize total early work
This page was built for publication: An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines
