Scheduling parallel batching machines in a sequence

DOI10.1007/s10951-018-0560-6zbMath1427.90156OpenAlexW2588704993MaRDI QIDQ2283298

Frits C. R. Spieksma, Ward Passchyn

Publication date: 30 December 2019

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/555947

zbMATH Keywords

complexitymachine schedulingmachine sequenceparallel batching machine

Mathematics Subject Classification ID

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

Related Items

Scheduling a proportionate flow shop of batching machines

Cites Work

• Mathematical programming models for lock scheduling with an emission objective
• The lockmaster's problem
• Complexity results for flow-shop and open-shop scheduling problems with transportation delays
• Some simplified NP-complete graph problems
• Scheduling time-constrained communication in linear networks
• Scheduling Bidirectional Traffic on a Path
• Simulation of alternative approaches to relieving congestion at locks in a river transportion system
• An Optimal Scheduling System for the Welland Canal
• Packet Forwarding Algorithms in a Line Network
• Two-Way Traffic on a Single Line of Railway

This page was built for publication: Scheduling parallel batching machines in a sequence