History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence

DOI10.1016/j.cor.2015.06.007zbMath1349.90336OpenAlexW2418175665MaRDI QIDQ342093

Mohan Krishnamoorthy, Andreas T. Ernst, Narayan Rangaraj, Vishnu Narayanan, Niraj Ramesh Dayama

Publication date: 17 November 2016

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

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

zbMATH Keywords

integer programmingcombinatorial optimizationcrane schedulingfixed interval schedulinghistory-dependent schedulingsequence-dependent scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

An uncertain parallel machine problem with deterioration and learning effect

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single-machine scheduling against due dates with past-sequence-dependent setup times
• The pickup and delivery problem with time windows
• On the complexity of blocks-world planning
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
• Production scheduling with history-dependent setup times
• Integer Programming Formulation of Traveling Salesman Problems
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• State-space relaxation procedures for the computation of bounds to routing problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• The General Pickup and Delivery Problem
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• The Vehicle Routing Problem with Time Windows Part II: Genetic Search
• Blocks World revisited
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut

This page was built for publication: History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence