Algorithms for single-machine scheduling problem with deterioration depending on a novel model (Q2628177): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Wai-Hung Ip / rank
Normal rank
 
Property / author
 
Property / author: Wai-Hung Ip / rank
 
Normal rank
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.3934/jimo.2016040 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2402477886 / 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: Single-machine scheduling with deteriorating functions for job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree-search algorithm for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with a nonlinear deterioration function / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling problems with an actual time-dependent deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested Partitions Method for Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Framework for Product Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate algorithms for unrelated machine scheduling to minimize makespan / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:38, 13 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for single-machine scheduling problem with deterioration depending on a novel model
scientific article

    Statements

    Algorithms for single-machine scheduling problem with deterioration depending on a novel model (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 June 2017
    0 references
    scheduling
    0 references
    deterioration model
    0 references
    release times
    0 references
    waiting times
    0 references
    branch and bound
    0 references
    rules guided nested partitions
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references