Relocation scheduling subject to fixed processing sequences

DOI10.1007/S10951-015-0455-8MaRDI QIDQ282245zbMATH OpenOpenAlexFDO

Authors B. M. T. Lin, Alexander Kononov, F. J. 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)

Recommendations

• An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
• Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
• Minimizing the total weighted completion time in the relocation problem
• Minimizing the total weighted completion time for the relocation scheduling problems with precedence constraints
• Some results of the relocation problems with processing times and deadlines

Cites work

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

Cited in

(12)

• Minimizing the total weighted completion time in the relocation problem
• Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
• Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines
• Generating the best \(K\) sequences in relocation problems
• On relocation problems with multiple identical working crews
• Resource-constrained flowshop scheduling with separate resource recycling operations
• An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
• A fast feasibility test for relocation problems
• Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence
• Minimizing the total weighted completion time for the relocation scheduling problems with precedence constraints
• On the relocation problem with a second working crew for resource recycling
• Tight complexity analysis of the relocation problem with arbitrary release dates

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

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