Relocation scheduling subject to fixed processing sequences
DOI10.1007/S10951-015-0455-8zbMATH Open1341.90051OpenAlexW2192809410MaRDI QIDQ282245FDOQ282245
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
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
dynamic programmingNP-hardnessfixed sequenceparallel dedicated machinesrelocation problemresource-constrained scheduling
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Project scheduling with inventory constraints
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- Complexity of single machine scheduling subject to nonnegative inventory constraints
- Optimal two- and three-stage production schedules with set-up time included
- A fast feasibility test for relocation problems
- Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
- Relocation problems are hard
- The open shop scheduling problem with a given sequence of jobs on one machine
- 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
- Title not available (Why is that?)
- Two‐machine flowshop scheduling with conditional deteriorating second operations
- 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
Cited In (8)
- On the relocation problem with a second working crew for resource recycling
- Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
- An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
- A fast feasibility test for relocation problems
- On relocation problems with multiple identical working crews
- Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines
- Generating the best \(K\) sequences in relocation problems
- Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence
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)
