Minimizing makespan on parallel machines subject to release dates and delivery times

DOI10.1002/jos.103zbMath1009.90047OpenAlexW2076677764MaRDI QIDQ1607981

Anis Gharbi, Mohamed Haouari

Publication date: 8 August 2002

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jos.103

zbMATH Keywords

schedulingbranch-and-boundmakespanrelease datesidentical parallel machinesdelivery times

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (18)

Integrated production and outbound distribution scheduling problems with job release dates and deadlines ⋮ Energetic reasoning revisited: Application to parallel machine scheduling ⋮ Optimal scheduling of a two-stage hybrid flow shop ⋮ Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem ⋮ Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem ⋮ An approximate decomposition algorithm for scheduling on parallel machines with heads and tails ⋮ Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates ⋮ Search tree based approaches for parallel machine scheduling ⋮ Bounding strategies for the hybrid flow shop scheduling problem ⋮ Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines. ⋮ Optimal parallel machines scheduling with availability constraints ⋮ Scheduling jobs with release and delivery times subject to nested eligibility constraints ⋮ Integrated scheduling of production and distribution with release dates and capacitated deliveries ⋮ A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem ⋮ Online Scheduling on Two Parallel Machines with Release Times and Delivery Times ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness ⋮ An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines ⋮ Online scheduling on two parallel machines with release dates and delivery times

Cites Work

• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• The one-machine sequencing problem
• A computational study of constraint satisfaction for multiple capacitated job shop scheduling
• A general lower bound for the makespan problem
• Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
• Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
• Scheduling with limited machine availability
• Bounds for naive multiple machine scheduling with release times and deadlines
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• Scheduling with earliest start and due date constraints on multiple machines
• Minimizing maximum lateness on one machine: computational experience and some applications
• `` Strong NP-Completeness Results
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Some simple scheduling algorithms
• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs

This page was built for publication: Minimizing makespan on parallel machines subject to release dates and delivery times