A decomposition approach to job-shop scheduling problem with discretely controllable processing times

DOI10.1007/S11431-010-4249-0zbMath1236.90057OpenAlexW2079912280MaRDI QIDQ412943

ShuDong Sun, Pascal Lafon, GangGang Niu, Hong-an Yang

Publication date: 4 May 2012

Published in: Science China. Technological Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11431-010-4249-0

zbMATH Keywords

decompositionjob-shop schedulingtime-cost tradeoffdiscretely controllable processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

This page was built for publication: A decomposition approach to job-shop scheduling problem with discretely controllable processing times