A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization

DOI10.1016/J.AMC.2014.11.103zbMath1338.90166OpenAlexW1967768830MaRDI QIDQ298761

Chérif Sadfi, Walid Hfaiedh, Imed Kacem, Atidel Ben Hadj-Alouane

Publication date: 21 June 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.11.103

zbMATH Keywords

schedulingsingle machinemaximum delivery timenon-availability constraint

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Simultaneous scheduling of production and preventive maintenance on a single machine

Cites Work

• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
• New single machine and job-shop scheduling problems with availability constraints
• Approximation algorithms for single machine scheduling with one unavailability period
• Single machine flow-time scheduling with a single breakdown
• The one-machine sequencing problem
• Scheduling with limited machine availability
• Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval
• SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Some simple scheduling algorithms

This page was built for publication: A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization