Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times (Q2688577): 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.3934/mbe.2022414 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4285297534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and algorithms of time-dependent scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriterion scheduling with group technology and deterioration effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-batch scheduling with deterioration and rejection on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common Due Window Assignment Scheduling with Proportional Linear Deterioration Effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: A common due-data assignment problem on parallel identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax scheduling problems with a common due-window / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax due-date assignment with a time window for acceptable lead-times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Due-Window Determination In Minmax Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax scheduling problems with common due-date and completion time penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax scheduling and due-window assignment with position-dependent processing times and job rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due date-related scheduling with two agents. Models and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due-window assignment scheduling in the proportionate flow shop setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource allocation flowshop scheduling with learning effect and slack due window assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due-window assignment scheduling with past-sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due date assignment scheduling with positional-dependent weights and proportional setup 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: Scheduling jobs under decreasing linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with two competing agents and learning consideration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriterion scheduling with truncated learning effects and convex controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects / rank
 
Normal rank

Latest revision as of 14:38, 31 July 2024

scientific article
Language Label Description Also known as
English
Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times
scientific article

    Statements

    Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 March 2023
    0 references
    minmax scheduling
    0 references
    common due-window
    0 references
    deterioration effect
    0 references

    Identifiers