Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080): 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.amc.2006.01.068 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005665367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of scheduling job families about a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batch setup times and earliness-tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Earliness and Tardiness Penalties: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the average deviation of job completion times about a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single- and multiple-processor models for minimizing completion time variance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling job families about an unrestricted common due date on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing mean absolute deviation of completion times about a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling to minimize absolute deviation of completion times from a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted common due date single machine scheduling problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine weighted earliness-tardiness penalty problem with a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due-date assignment and early/tardy scheduling on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel machine min-max weighted absolute lateness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due window scheduling for parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling under a common due-date on parallel unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parallel Machine Scheduling Problems by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Early/tardy scheduling with sequence dependent setups on uniform parallel machines / 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

Latest revision as of 11:16, 25 June 2024

scientific article
Language Label Description Also known as
English
Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
scientific article

    Statements

    Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (English)
    0 references
    0 references
    0 references
    7 December 2006
    0 references
    0 references
    earliness--tardiness scheduling
    0 references
    incompatible families
    0 references
    MIP formulation
    0 references
    0 references
    0 references