MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS (Q2873830): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Scheduling Deteriorating Jobs on a Single Processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling with position-based deteriorating jobs and learning effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-machine scheduling with simple linear deterioration to minimize total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-machine scheduling of simple linear deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard cases in scheduling deteriorating jobs on dedicated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of job-shop scheduling with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Browne-Yechiali single-machine sequence is optimal for flow-shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop scheduling problems with decreasing linear deterioration under dominant machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total completion time in a two-machine flow shop with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in three-machine flow shops with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop scheduling problems with deteriorating jobs under dominating machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: SINGLE MACHINE SCHEDULING WITH LINEAR DETERIORATING JOBS UNDER PREDICTIVE DISRUPTION / rank
 
Normal rank

Revision as of 06:27, 7 July 2024

scientific article
Language Label Description Also known as
English
MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS
scientific article

    Statements

    MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS (English)
    0 references
    0 references
    0 references
    27 January 2014
    0 references
    scheduling
    0 references
    makespan
    0 references
    flow shop
    0 references
    branch-and-bound algorithm
    0 references
    deteriorating jobs
    0 references

    Identifiers