Lagrangian relaxation and column generation-based lower bounds for the Pm,h_j1 w_iC_i scheduling problem
From MaRDI portal
Publication:470933
Recommendations
- Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
- Improved bounds on relaxations of a parallel machine scheduling problem
- Lagrangian relaxation and constraint generation for allocation and advanced scheduling
- On the NP-completeness of the n/m/parallel/\(\sum_{i\leq i\leq m}\{\sum w_ j\sum t_ j\}\) scheduling problem
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- Dynamic programming approach to the \(n/m/\)parallel\(/\sum_{i=1}^{m} \{\sum {w_ j} \sum {t_ j} \}\) scheduling problem
- scientific article; zbMATH DE number 4199945
- An LPT-bound for a parallel multiprocessor scheduling problem
- A new Lagrangian relaxation algorithm for scheduling dissimilar parallel machines with release dates
Cites work
- A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Approximation algorithms for single machine scheduling with one unavailability period
- Approximation schemes for parallel machine scheduling with availability constraints
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem
- Exponential inapproximability and FPTAS for scheduling with availability constraints
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
- Machine scheduling with an availability constraint
- Minimizing the sum of job completion times on capacitated two-parallel machines
- New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
- Parallel machine scheduling by column generation
- Parallel machines scheduling with machine maintenance for minsum criteria
- Parallel machines scheduling with nonsimultaneous machine available time
- Parallel-machine scheduling with non-simultaneous machine available time
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Scheduling identical parallel machines to minimize total weighted completion time
- Scheduling independent tasks to reduce mean finishing time
- Single machine flow-time scheduling with a single breakdown
- Single machine flow-time scheduling with scheduled maintenance
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- Solving Parallel Machine Scheduling Problems by Column Generation
- Steel-making process scheduling using Lagrangian relaxation
- Weighted flow time bounds for scheduling identical processors
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
Cited in
(2)
This page was built for publication: Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q470933)
