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

DOI10.1016/J.IPL.2010.04.002zbMATH Open1233.68229OpenAlexW2045960358MaRDI QIDQ763542FDOQ763542

Steef van de Velde, Xiandong Zhang

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

greedy algorithmcompetitive analysisschedulingjob shoptime lags

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
• Two-machine interval shop scheduling with time lags

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763542)