Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach
From MaRDI portal
Publication:2356184
DOI10.1016/j.ejor.2013.06.021zbMath1317.90103OpenAlexW2022238582MaRDI QIDQ2356184
M. Karimi-Nasab, S. M. Seyedhoseini
Publication date: 29 July 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.06.021
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30)
Related Items (6)
Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Lead time considerations for the multi-level capacitated lot-sizing problem ⋮ A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry ⋮ An asynchronous parallel disassembly planning based on genetic algorithm ⋮ A Benders decomposition approach for solving the offshore wind farm installation planning at the North Sea ⋮ Minimizing maximum tardiness and delivery costs with batch delivery and job release times
Uses Software
Cites Work
- A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry
- Real-time production planning and control system for job-shop manufacturing: a system dynamics analysis
- Control methods for dynamic time-based manufacturing under customized product lead times
- Multi-level single machine lot-sizing and scheduling with zero lead times
- The stochastic economic lot scheduling problem: a survey
- A multi-objective production smoothing model with compressible operating times
- Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A mixed integer programming model for advanced planning and scheduling (APS)
- Scheduling a hybrid flowshop with batch production at the last stage
- A mathematical programming model and solution for scheduling production orders in Shanghai Baoshan Iron and Steel Complex
- Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem
- An integrated tabu search algorithm for the lot streaming problem in job shops
- The use of genetic algorithms to solve the economic lot size scheduling problem
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
- A capacity-oriented hierarchical approach to single-item and small-batch production planning using project-scheduling methods
- Current trends in deterministic scheduling
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
- An operational decision model for lead-time and price quotation in congested manufacturing systems
- A heuristic to schedule flexible job-shop in a glass factory
- Deterministic job-shop scheduling: Past, present and future
- Batch scheduling in process industries: An application of resource-constrained project scheduling
- Solving the serial batching problem in job shop manufacturing systems
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
- A lot-sizing and scheduling model for multi-stage flow lines with zero lead times
- The hybrid flow shop scheduling problem
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Shortening cycle times in multi-product, capacitated production environments through quality level improvements and setup reduction
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- A survey of scheduling with controllable processing times
- A profit-maximizing economic lot scheduling problem with price optimization
- A linear programming embedded genetic algorithm for an integrated cell formation and lot sizing considering product quality
- A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs
- An approach for integrated scheduling and lot-sizing
- A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains
- Simultaneous batch splitting and scheduling on identical parallel production lines
- Simulated annealing and genetic algorithms for scheduling products with multi-level product structure
- Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales
- Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources
- Lot streaming multiple jobs in a flow shop
- Economic lot scheduling problems incorporating a cost of using the production facility
- Scheduling with time dependent processing times: Review and extensions
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
- A genetic algorithm for solving the economic lot scheduling problem in flow shops
- Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Uncertainty under MRP-planned manufacture: Review and categorization
- Integrated Material Planning and Operations Scheduling (IMPOS)
- Production Planning by Mixed Integer Programming
- Multilevel capacitated lot-sizing and resource-constrained project scheduling: an integrating perspective
- Scheduling
- The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops.
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
This page was built for publication: Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach
