Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032): 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.1016/j.amc.2010.11.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982961869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with time dependent processing times: Review and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of scheduling with time-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Deteriorating Jobs on a Single Processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of scheduling starting time dependent tasks with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of scheduling tasks with time-dependent execution times / rank
 
Normal rank
Property / cites work
 
Property / cites work: V-Shaped Policies for Scheduling Deteriorating Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under simple linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with start time dependent processing times: Some solvable cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under decreasing linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due-date assignment and parallel-machine scheduling with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine group scheduling problems with deterioration consideration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A due-date assignment problem with learning effect and deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling time-dependent jobs under mixed deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with time dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Machine Scheduling With Linear Deterioration / 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 with time dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties / 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: Flow shop scheduling problems with deteriorating jobs under dominating machines / 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: 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: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with dominant machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine total completion time flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved branch-and-bound algorithm for the two machine total completion time flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on flow shop scheduling problems with a learning effect on no-idle dominant machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum to: ``A note on flow shop scheduling problems with a learning effect on no-idle dominant machines'' by M. Cheng et al. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization in machine dominated flowshop / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:59, 3 July 2024

scientific article
Language Label Description Also known as
English
Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
scientific article

    Statements

    Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (English)
    0 references
    0 references
    2 February 2011
    0 references
    0 references
    scheduling
    0 references
    flow shop
    0 references
    simple linear deterioration
    0 references
    total weighted completion time
    0 references
    branch-and-bound algorithm
    0 references
    heuristic algorithm
    0 references
    0 references
    0 references