On-line two-machine job shop scheduling with time lags

DOI10.1016/J.IPL.2010.04.002zbMath1233.68229OpenAlexW2045960358MaRDI QIDQ763542

Xiandong Zhang, Steef L. van de Velde

Publication date: 12 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.04.002

zbMATH Keywords

schedulinggreedy algorithmcompetitive analysisjob shoptime lags

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time

Cites Work

• Unnamed Item
• Tactically delayed versus non-delay scheduling: An experimental investigation
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Analysis of heuristics for the UET two-machine flow shop problem with time delays
• On-line two-machine open shop scheduling with time lags
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Shop Problems With Two Machines and Time Lags
• Job Shop Sequencing Problem on Two Machines with Time Lag Constraints

This page was built for publication: On-line two-machine job shop scheduling with time lags