Scheduling with returnable containers

DOI10.1007/S10951-015-0426-0zbMath1333.90050OpenAlexW1983215102MaRDI QIDQ906554

Arne Mensendiek

Publication date: 22 January 2016

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

Full work available at URL: https://doi.org/10.1007/s10951-015-0426-0

zbMATH Keywords

earlinessbatchingheuristic algorithmstardinesssingle machine schedulingfamily setupsreturnable containers

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• Earliness-tardiness scheduling with setup considerations
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• Scheduling with batching: A review
• A survey of scheduling problems with setup times or costs
• Single machine scheduling with family setups to minimize total earliness and tardiness
• Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
• Sequencing with Earliness and Tardiness Penalties: A Review
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Scheduling job families about an unrestricted common due date on a single machine

This page was built for publication: Scheduling with returnable containers