Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
type: Item
instance of: scholarly article
title: Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
zbMATH Open document ID: 1298.90044
author: Racem Mellouli
author: Imed Kacem
author: Chérif Sadfi
author: Chengbin Chu
published in: Applied Mathematics and Computation
publication date: 2014-11-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6369258
zbMATH Keywords: scheduling
zbMATH Keywords: availability constraint
zbMATH Keywords: parallel machines
zbMATH Keywords: total weighted completion time
MaRDI profile type: Publication
full work available at URL: j.amc.2013.05.004
OpenAlex ID: W2204206022
cites work: Single machine flow-time scheduling with a single breakdown
cites work: Scheduling identical parallel machines to minimize total weighted completion time
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: Solving Parallel Machine Scheduling Problems by Column Generation
cites work: Exponential inapproximability and FPTAS for scheduling with availability constraints
cites work: Approximation schemes for parallel machine scheduling with availability constraints
cites work: Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
cites work: Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
cites work: Approximation algorithms for single machine scheduling with one unavailability period
cites work: Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
cites work: Parallel machines scheduling with nonsimultaneous machine available time
cites work: Machine scheduling with an availability constraint
cites work: Capacitated two-parallel machines scheduling to minimize sum of job completion times
cites work: Single machine flow-time scheduling with scheduled maintenance
cites work: A new dynamic programming algorithm for the parallel machines total weighted completion time problem
cites work: Minimizing the sum of job completion times on capacitated two-parallel machines
cites work: Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
cites work: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
cites work: Parallel-machine scheduling with non-simultaneous machine available time
cites work: Parallel machines scheduling with machine maintenance for minsum criteria
cites work: A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production
cites work: Steel-making process scheduling using Lagrangian relaxation
cites work: Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem
cites work: Parallel machine scheduling by column generation
cites work: Preemptive scheduling with availability constraints to minimize total weighted completion times
cites work: New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
cites work: Weighted flow time bounds for scheduling identical processors
Wikidata QID: Q57185628
DOI: 10.1016/J.AMC.2013.05.004
Recommended article: Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
Recommended article: Improved bounds on relaxations of a parallel machine scheduling problem
Recommended article: Lagrangian relaxation and constraint generation for allocation and advanced scheduling
Recommended article: On the NP-completeness of the n/m/parallel/\(\sum_{i\leq i\leq m}\{\sum w_ j\sum t_ j\}\) scheduling problem
Recommended article: A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
Recommended article: Dynamic programming approach to the \(n/m/\)parallel\(/\sum_{i=1}^{m} \{\sum {w_ j} \sum {t_ j} \}\) scheduling problem
Recommended article: Q3348687
Recommended article: An LPT-bound for a parallel multiprocessor scheduling problem
Recommended article: A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates
description: scientific article; zbMATH DE number 6369258