A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
From MaRDI portal
Publication:1610145
DOI10.1016/S0377-2217(98)00136-2zbMath1009.90040OpenAlexW2068265913MaRDI QIDQ1610145
Warren B. Powell, Zhi-Long Chen
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00136-2
column generationbranch and boundDantzig-Wolfe decompositionjust-in-timeparallel machine schedulingset partitioning
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs, A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers, Machine scheduling with earliness, tardiness and non-execution penalties, Batching scheduling in a two-level supply chain with earliness and tardiness penalties, A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times, Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics, An improved decision support model for scheduling production in an engineer-to-order manufacturer, Branch-and-price approach for the multi-skill project scheduling problem, Exponential neighborhood search for a parallel machine scheduling problem, Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates, Two branch-and-bound algorithms for the robust parallel machine scheduling problem, Column-Generation in Integer Linear Programming, Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations, Multicriteria scheduling, Parallel machine earliness and tardiness scheduling with proportional weights
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach for crew pairing problems by column generation with an application to air transportation
- Solving binary cutting stock problems by column generation and branch- and-bound
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
- A note on one-processor scheduling with asymmetric earliness and tardiness penalties
- Parallel Machine Scheduling by Column Generation
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Decomposition Principle for Linear Programs
- Sequencing with Earliness and Tardiness Penalties: A Review
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
- Due-date assignment and early/tardy scheduling on identical parallel machines
- Error Bound of a Heuristic for the Common Due Date Scheduling Problem
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
- A Column Generation Approach for Graph Coloring
- Solving Parallel Machine Scheduling Problems by Column Generation
- Single-machine scheduling with early and tardy completion costs
