Energetic reasoning revisited: Application to parallel machine scheduling
type: Item
instance of: scholarly article
title: Energetic reasoning revisited: Application to parallel machine scheduling
zbMATH Open document ID: 1168.90444
author: Lotfi Hidri
author: Anis Gharbi
author: Mohamed Haouari
published in: Journal of Scheduling
publication date: 2009-08-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5599862
zbMATH Keywords: scheduling
zbMATH Keywords: release dates
zbMATH Keywords: due dates
zbMATH Keywords: makespan
zbMATH Keywords: feasibility and adjustment procedures
zbMATH Keywords: energetic reasoning
zbMATH Keywords: branch-and-bound
MaRDI profile type: Publication
full work available at URL: s10951-008-0070-z
OpenAlex ID: W2022820435
cites work: Tight LP bounds for resource constrained project scheduling
cites work: Satisfiability tests and time-bound adjustments for cumulative scheduling problems
cites work: The job-shop problem and immediate selection
cites work: Scheduling jobs with release dates and tails on identical machines to minimize the makespan
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem
cites work: Adjustment of heads and tails for the job-shop problem
cites work: Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
cites work: A branch-and-bound algorithm for the resource-constrained project scheduling problem
cites work: Minimizing makespan on parallel machines subject to release dates and delivery times
cites work: Optimal parallel machines scheduling with availability constraints
cites work: An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
cites work: Bounds for naive multiple machine scheduling with release times and deadlines
cites work: An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
cites work: Lower bounds for scheduling on identical parallel machines with heads and tails
cites work: Some simple scheduling algorithms
cites work: Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
cites work: Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines.
cites work: Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
cites work: Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop
DOI: 10.1007/S10951-008-0070-Z
description: scientific article; zbMATH DE number 5599862