Exact algorithms for single-machine scheduling with time windows and precedence constraints
type: Item
instance of: scholarly article
title: Exact algorithms for single-machine scheduling with time windows and precedence constraints
zbMATH Open document ID: 1347.90037
author: Morteza Davari
author: Roel Leus
author: Fabrice Talla Nobibon
author: Erik Demeulemeester
published in: Journal of Scheduling
publication date: 2016-09-08T00:00:00Z
full work available at URL: https://lirias.kuleuven.be/handle/123456789/494595
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6625288
zbMATH Keywords: single-machine scheduling
zbMATH Keywords: branch and bound
zbMATH Keywords: mixed integer programming
describes a project that uses: RanGen
MaRDI profile type: Publication
OpenAlex ID: W2021426411
cites work: Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
cites work: A survey of algorithms for the single machine total weighted tardiness scheduling problem
cites work: A new dominance rule to minimize total weighted tardiness with unequal release dates.
cites work: Optimal Reduction of Two-Terminal Directed Acyclic Graphs
cites work: Scheduling with release dates on a single machine to minimize total weighted completion time
cites work: Maximum series-parallel subgraph
cites work: Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
cites work: Q4658190
cites work: A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
cites work: Rangen: A random network generator for activity-on-the-node networks
cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Q4198056
cites work: Single machine scheduling with deadlines, release and due dates
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time
cites work: A Dynamic Programming Approach to Sequencing Problems
cites work: Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
cites work: A dynamic programming method for single machine scheduling
cites work: The concrete delivery problem
cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints
cites work: Q4124332
cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
cites work: Q4124328
cites work: The two-machine flow shop problem with arbitrary precedence relations
cites work: Scheduling problems in parallel systems for telecommunications
cites work: Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
cites work: An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time.
cites work: Scheduling
cites work: Minimizing Weighted Completion Times with Deadlines
cites work: A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
cites work: An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
cites work: Q5433151
cites work: Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
cites work: A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
cites work: An exact algorithm for single-machine scheduling without machine idle time
cites work: An exact algorithm for the precedence-constrained single-machine scheduling problem
cites work: Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
cites work: The Recognition of Series Parallel Digraphs
cites work: Dual decomposition of a single-machine scheduling problem
cites work: Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
DOI: 10.1007/S10951-015-0428-Y
description: scientific article; zbMATH DE number 6625288