Scheduling with centralized and decentralized batching policies in concurrent open shops
From MaRDI portal
Publication:2994798
DOI10.1002/nav.20437zbMath1210.90091OpenAlexW1986555242WikidataQ115150509 ScholiaQ115150509MaRDI QIDQ2994798
Cheng, T. C. Edwin, Bertrand M. T. Lin
Publication date: 29 April 2011
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20437
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (5)
Optimal single machine scheduling of products with components and changeover cost ⋮ 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 ⋮ Two-machine flowshop scheduling in a physical examination center ⋮ Iterated greedy algorithms for a complex parallel machine scheduling problem
Cites Work
- Unnamed Item
- Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
- Batching decisions for assembly production systems
- Open shops with jobs overlap -- revisited
- Batch sizing and job sequencing on a single machine
- Order scheduling in an environment with dedicated resources in parallel
- A note on the complexity of the concurrent open shop problem
- Batching and scheduling in a multi-machine flow shop
- Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps
- The complexity of one-machine batching problems
- Open shops with jobs overlap
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- Concurrent open shop scheduling to minimize the weighted number of tardy jobs
- Scheduling with batching: A review
- Customer order scheduling to minimize the number of late jobs
- Scheduling orders for multiple product types with due date related objectives
- Lot streaming with supplier-manufacturer coordination
- The open shop scheduling problem with a given sequence of jobs on one machine
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- Scheduling Groups of Jobs on a Single Machine
- Two‐machine flowshop scheduling with conditional deteriorating second operations
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
This page was built for publication: Scheduling with centralized and decentralized batching policies in concurrent open shops
