A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time

From MaRDI portal
Revision as of 21:49, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2434288

DOI10.1007/s10951-011-0242-0zbMath1280.90073OpenAlexW2023149476MaRDI QIDQ2434288

Shunji Tanaka, Shuji Fujikuma

Publication date: 5 February 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2433/156178




Related Items (24)

Ant colony systems for the single-machine total weighted earliness tardiness scheduling problemExact algorithms for single-machine scheduling with time windows and precedence constraintsA hybrid heuristic approach for single machine scheduling with release timesExact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup timesAn exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup timesAn exact algorithm for the bi-objective timing problemScheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion timeOn the mass COVID-19 vaccination scheduling problemMinimizing makespan on a single machine with release dates and inventory constraintsExact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due dateA hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problemAn Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling ProblemOn the exact solution of a large class of parallel machine scheduling problemsAn Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling ProblemsDual relaxations of the time-indexed ILP formulation for min-sum scheduling problemsA mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints\textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search treesA Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling ProblemsIntegrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routersA unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problemsOrder assignment and scheduling under processing and distribution time uncertaintyA classification of dynamic programming formulations for offline deterministic single-machine scheduling problemsStructured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion timesAn exact algorithm for the precedence-constrained single-machine scheduling problem



Cites Work


This page was built for publication: A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time