Information for "A dynamic programming method for single machine scheduling"

Basic information

Display title	A dynamic programming method for single machine scheduling
Default sort key	A dynamic programming method for single machine scheduling
Page length (in bytes)	15
Namespace ID	0
Page ID	9216334
Page content language	en - English
Page content model	wikitext
Indexing by robots	Allowed
Number of redirects to this page	1
Counted as a content page	Yes
Page views in the past month	0
MaRDI portal item ID	Q1331548

Page protection

Edit	Allow all users (infinite)
Move	Allow all users (infinite)

View the protection log for this page.

Edit history

Page creator	Import240129110113 (talk \| contribs)
Date of page creation	13:52, 31 January 2024
Latest editor	AllProfilePages260409040437 (talk \| contribs)
Date of latest edit	02:01, 13 April 2026
Total number of edits	2
Recent number of edits (within past 90 days)	1
Recent number of distinct authors	1

Page properties

Transcluded templates (20)	Pages included on this page: Template:Badge (view source) Template:BadgeSimple (view source) Template:Badges/styles.css (view source) Template:DeepChat (view source) Template:ItemCards/styles.css (view source) Template:ItemLink (view source) Template:Publication (view source) Template:Publication/styles.css (view source) Template:ReportABug (view source) Module:BacklinksList (view source) Module:HelperMethods (view source) Module:HelperStrConverter (view source) Module:PublicationCitesWork (view source) Module:PublicationJournalEntry (view source) Module:PublicationKeywordList (view source) Module:PublicationMSCList (view source) Module:PublicationRecommendedItems (view source) Module:PublicationShowAbstract (view source) Module:Wd (view source) Module:Wd/i18n (view source)
MaRDI portal entities used in this page	published in Miscellaneous (e.g. entity existence) Label: en full work available at URL Miscellaneous (e.g. entity existence) Label: en Mathematics Subject Classification ID Miscellaneous (e.g. entity existence) Label: en publication date Miscellaneous (e.g. entity existence) Label: en Dynamic programming and decomposition approaches for the single machine total tardiness problem Label: en Title The use of dynamic programming in genetic algorithms for permutation problems Title Yuichi Nakamura Label: en Title A dynamic programming method for single machine scheduling Title Miscellaneous (e.g. entity existence) Label: en Some statements Sitelink A dynamic programming algorithm for single machine scheduling with ready times Label: en Title Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem Title Toshihide Ibaraki Label: en Title Exact approaches for solving a covering problem with capacitated subtrees Title An exact approach for scheduling jobs with regular step cost functions on a single machine Title An algorithm for constructing single processor static-dynamic schedules Title A decomposition algorithm for the single machine total tardiness problem Title Label: en Single machine scheduling with symmetric earliness and tardiness penalties Title Precedence theorems and dynamic programming for the single-machine weighted tardiness problem Title An iterative dynamic programming approach for the temporal knapsack problem Title A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems Title An application of dynamic programming to assign pressing tanks at wineries Title An exact algorithm for single-machine scheduling without machine idle time Title Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms Title An exact algorithm for the precedence-constrained single-machine scheduling problem Title A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time Title Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date Title Solving talent scheduling with dynamic programming Title An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem Title Exact algorithms for single-machine scheduling with time windows and precedence constraints Title The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation Title A Dynamic Programming Approach to Sequencing Problems Title Label: en An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times Title A Branch and Bound Algorithm for the Total Weighted Tardiness Problem Title Label: en Dynamic Programming State-Space Relaxation for Single-Machine Scheduling Label: en Title A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem Label: en Title State-space relaxation procedures for the computation of bounds to routing problems Title Label: en Minimizing Total Costs in One-Machine Scheduling Title Label: en Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems Title An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems Title Minimization of unsmooth functionals Title Label: en European Journal of Operational Research Label: en Minmax scheduling with job-classes and earliness-tardiness costs Title Dynamic programming approach to the single-machine sequencing problem with different due-dates Label: en Title