A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags

DOI10.1016/J.EJOR.2006.06.003zbMath1121.90063OpenAlexW1984745113MaRDI QIDQ872246

Lu-Wen Liao, Gwo-Ji Sheen

Publication date: 27 March 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.003

zbMATH Keywords

schedulingmakespanbranch and bound algorithmminimum and maximum time lagsone machine

Mathematics Subject Classification ID

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

Related Items (1)

A survey on scheduling problems with due windows

Cites Work

• A practical use of Jackson's preemptive schedule for solving the job shop problem
• The one-machine sequencing problem
• A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
• A branch and bound algorithm for the job-shop scheduling problem
• The job-shop problem and immediate selection
• A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
• Adjustment of heads and tails for the job-shop problem
• One-machine generalized precedence constrained scheduling problems
• Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
• Order-based neighborhoods for project scheduling with nonregular objective functions.
• Resource-constrained project scheduling: A survey of recent developments.
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Recent results on resource-constrained project scheduling with time windows: Models, solution methods, and applications
• A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• A restricted Lagrangean approach to the traveling salesman problem
• The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
• A modified shifting bottleneck procedure for job-shop scheduling
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• Project scheduling with calendars
• Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
• Unnamed Item

This page was built for publication: A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags