Solving the serial batching problem in job shop manufacturing systems
From MaRDI portal
Publication:1926815
DOI10.1016/j.ejor.2012.03.001zbMath1253.90119MaRDI QIDQ1926815
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.03.001
90B35: Deterministic scheduling theory in operations research
Related Items
Controller design for stochastic Markovian switching systems with time-varying delay and actuator saturation, A constructive method to static output stabilisation of Markov jump systems, Finite-time \(L_1\) control for positive Markovian jump systems with partly known transition rates, Stochastic stability analysis and \(L_\infty\)-gain controller design for positive Markov jump systems with time-varying delays, A tabu search/path relinking algorithm to solve the job shop scheduling problem, Finite-time \(H_{\infty}\) control for linear systems with semi-Markovian switching, Robust finite-time \(H_\infty\) control for Markovian jump systems with partially known transition probabilities, State feedback controller design for singular positive Markovian jump systems with partly known transition rates, Robust finite-time output feedback \(H_\infty\) control for stochastic jump systems with incomplete transition rates, Robust \(H_\infty\) control for stochastic Markovian switching systems under partly known transition probabilities and actuator saturation via anti-windup design, \(L_1\) control for positive Markovian jump systems with time-varying delays and partly known transition rates, Anti-windup design for stochastic Markovian switching systems with mode-dependent time-varying delays and saturation nonlinearity, Robust finite-time \(H_\infty\) control for nonlinear Markovian jump systems with time delay under partially known transition probabilities, \(H_\infty\) observer design for stochastic time-delayed systems with Markovian switching under partly known transition rates and actuator saturation, Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration, Iterated greedy algorithms for a complex parallel machine scheduling problem, Finite-time \(H_\infty\) control for singular Markovian jump systems with partly unknown transition rates, Finite-time \(H_\infty\) filtering for discrete-time singular Markovian jump systems with time delay and input saturation, Stochastic stability and \(\mathcal{L}_1\)-gain analysis for positive nonlinear semi-Markov jump systems with time-varying delay via T-S fuzzy model approach, Simultaneous fault detection and control for continuous-time Markovian jump systems with partially unknown transition probabilities, Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach, Stabilization for positive Markovian jump systems with actuator saturation, Positive observer design for positive Markovian jump systems with partly known transition rates, Accelerating the calculation of makespan used in scheduling improvement heuristics
Cites Work
- Unnamed Item
- Real-time production planning and control system for job-shop manufacturing: a system dynamics analysis
- Batching and scheduling in a multi-machine flow shop
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
- An integrated tabu search algorithm for the lot streaming problem in job shops
- The two-machine sequence dependent flowshop scheduling problem
- Single machine scheduling with batch deliveries
- The complexity of one-machine batching problems
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
- Scheduling with batching: A review
- The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
- Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
- Batch scheduling on a two-machine jobshop with machine-dependent setup times
- Scheduling job shop problems with sequence-dependent setup times
- Flow-shop batch scheduling with identical processing-time jobs
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On the Complexity of Scheduling with Batch Setup Times
- The Reactive Tabu Search
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Impact of family-based scheduling on transfer batches in a job shop manufacturing cell
- Scheduling unbalanced cellular manufacturing systems with lot splitting
- Scheduling Groups of Jobs on a Single Machine
