Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
From MaRDI portal
Publication:3156731
DOI10.1002/nav.20000zbMath1054.90028OpenAlexW2118923355MaRDI QIDQ3156731
Kerem Bülbül, Candace Arai Yano, Philip M. Kaminsky
Publication date: 11 January 2005
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20000
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items
Preemption in single machine earliness/tardiness scheduling ⋮ Joint optimization of production scheduling and group preventive maintenance planning in multi-machine systems ⋮ An exact quadratic programming approach based on convex reformulation for seru scheduling problems ⋮ A linear programming-based method for job shop scheduling ⋮ Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity ⋮ Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization problem ⋮ Multicriteria models for just-in-time scheduling ⋮ A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production ⋮ Solving an integrated scheduling and routing problem with inventory, routing and penalty costs ⋮ A routing and scheduling approach to rail transportation of hazardous materials with demand due dates ⋮ The job shop scheduling problem with convex costs ⋮ Group-scheduling problems in electronics manufacturing ⋮ Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs ⋮ An optimisation-oriented model of distributed supply-chain ⋮ Multicriteria scheduling ⋮ A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- Equivalence of mean flow time problems and mean absolute deviation problems
- A time indexed formulation of non-preemptive single machine scheduling problems
- An exact algorithm for IP column generation
- A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints
- A polyhedral approach to single-machine scheduling problems.
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- A decomposition algorithm for the single machine total tardiness problem
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
- Parallel Machine Scheduling by Column Generation
- Drive: Dynamic Routing of Independent Vehicles
- Single Machine Scheduling with Release Dates
- Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Sequencing with Earliness and Tardiness Penalties: A Review
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
- Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Solving Parallel Machine Scheduling Problems by Column Generation
- Optimization guided lower and upper bounds for the resource investment problem
- Scheduling jobs and maintenance activities on parallel machines
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
- Parallel machine scheduling with a common due window
