Relocation scheduling subject to fixed processing sequences

DOI10.1007/s10951-015-0455-8zbMath1341.90051OpenAlexW2192809410MaRDI QIDQ282245

Bertrand M. T. Lin, Alexander V. Kononov, Feng-Jang Hwang

Publication date: 12 May 2016

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

Full work available at URL: https://doi.org/10.1007/s10951-015-0455-8

zbMATH Keywords

dynamic programmingNP-hardnessfixed sequenceparallel dedicated machinesrelocation problemresource-constrained scheduling

Mathematics Subject Classification ID

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

Related Items (3)

An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences ⋮ Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines ⋮ Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence

Cites Work

• Unnamed Item
• Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
• Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence
• Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
• On relocation problems with multiple identical working crews
• Batching and scheduling in a multi-machine flow shop
• Minimizing the total weighted completion time in the relocation problem
• Complexity of single machine scheduling subject to nonnegative inventory constraints
• A fast feasibility test for relocation problems
• Project scheduling with inventory constraints
• Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
• Optimal two- and three-stage production schedules with setup times included
• Relocation problems are hard
• The open shop scheduling problem with a given sequence of jobs on one machine
• Two‐machine flowshop scheduling with conditional deteriorating second operations

This page was built for publication: Relocation scheduling subject to fixed processing sequences