Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times (Q2462548): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2006.10.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000044964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times / 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: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / 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: Computer-Aided complexity classification of combinational problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / 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: PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES / 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: Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better / 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: Minimizing maximum lateness with job families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling two job classes on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with batch set-up times to minimize maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times / rank
 
Normal rank

Latest revision as of 13:48, 27 June 2024

scientific article
Language Label Description Also known as
English
Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
scientific article

    Statements

    Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times (English)
    0 references
    0 references
    0 references
    30 November 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    single machine
    0 references
    setup times
    0 references
    heuristics
    0 references
    dynamic programming
    0 references
    0 references