Minimizing makespan on parallel machines subject to release dates and delivery times
type: Item
instance of: scholarly article
title: Minimizing makespan on parallel machines subject to release dates and delivery times
zbMATH Open document ID: 1009.90047
author: Anis Gharbi
author: Mohamed Haouari
published in: Journal of Scheduling
publication date: 2002-08-08T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1777551
zbMATH Keywords: scheduling
zbMATH Keywords: identical parallel machines
zbMATH Keywords: makespan
zbMATH Keywords: release dates
zbMATH Keywords: delivery times
zbMATH Keywords: branch-and-bound
MaRDI profile type: Publication
full work available at URL: jos.103
OpenAlex ID: W2076677764
cites work: Minimizing maximum lateness on one machine: computational experience and some applications
cites work: `` Strong '' NP-Completeness Results
cites work: Some simple scheduling algorithms
cites work: A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
cites work: Scheduling jobs with release dates and tails on identical machines to minimize the makespan
cites work: Bounds for naive multiple machine scheduling with release times and deadlines
cites work: Scheduling with earliest start and due date constraints on multiple machines
cites work: Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
cites work: The one-machine sequencing problem
cites work: A computational study of constraint satisfaction for multiple capacitated job shop scheduling
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
cites work: A general lower bound for the makespan problem
cites work: Scheduling with limited machine availability
DOI: 10.1002/JOS.103
description: scientific article; zbMATH DE number 1777551