Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints

DOI10.1016/J.COR.2009.11.008MaRDI QIDQ2270437zbMATH OpenOpenAlexFDO

Authors Zhixin Liu

Publication date 18 March 2010

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2009.11.008

zbMATH Keywords

branch and bound algorithmdeterministic schedulingmaximum latenessprecedence constraintrelease date

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for single machine sequencing with release dates to minimize maximum cost
• scientific article; zbMATH DE number 32246
• A branch and bound algorithm to minimize total weighted tardiness on a single processor
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints
• Maximization problems in single machine scheduling

Cites work

• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Guided local search with shifting bottleneck for job shop scheduling
• scientific article; zbMATH DE number 3691044 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 1167865 (Why is no real title available?)
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Minimizing maximum lateness on one machine: computational experience and some applications
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Rescheduling for multiple new orders
• Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
• Some simple scheduling algorithms
• The one-machine sequencing problem
• Two-Processor Scheduling with Start-Times and Deadlines
• Variable neighborhood search: Principles and applications

Cited in

(21)

• Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
• An algorithm for single machine sequencing with release dates to minimize maximum cost
• On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
• A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints
• MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
• Single machine rescheduling for new orders with maximum lateness minimization
• Scheduling a single machine with primary and secondary objectives
• A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization
• Exact algorithms for single-machine scheduling with time windows and precedence constraints
• scientific article; zbMATH DE number 5151903 (Why is no real title available?)
• scientific article; zbMATH DE number 32246 (Why is no real title available?)
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
• An improved branch-and-bound algorithm for the one-machine scheduling problem with delayed precedence constraints
• Some complexity results and an efficient algorithm for quay crane scheduling problem
• Single machine scheduling with release times, deadlines and tardiness objectives
• Maximization problems in single machine scheduling
• An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times
• Scheduling Algorithms for Single Machine Problem with Release and Delivery Times
• Improving the preemptive bound for the single machine dynamic maximum lateness problem
• An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date
• A fast local search for the identical parallel machine scheduling problem with the position-based deteriorating effect and maintenance

This page was built for publication: Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270437)