Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times (Q4394265): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207549408956998 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048970339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with due-dates and early start times to minimize maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3899811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum lateness on one machine: computational experience and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Scheduling with Batch Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3989986 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:54, 28 May 2024

scientific article; zbMATH DE number 1162731
Language Label Description Also known as
English
Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
scientific article; zbMATH DE number 1162731

    Statements

    Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times (English)
    0 references
    0 references
    0 references
    11 June 1998
    0 references
    rolling horizon heuristics
    0 references
    maximum lateness
    0 references
    single machine
    0 references
    sequence-dependent setup times
    0 references
    branch-and-bound
    0 references

    Identifiers