Single-machine common due date total earliness/tardiness scheduling with machine unavailability (Q2286433): 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.1007/s10951-018-0585-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2891075930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine flow-time scheduling with a single breakdown / 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: Sequencing with Earliness and Tardiness Penalties: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Position-Dependent Maintenance Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934199 / 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, II: Deviation of Completion Times About a Restrictive Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling around a small common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with periodic maintenance to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times / 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: A binary multiple knapsack model for single machine scheduling with machine unavailability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling with ready-times, due-dates and vacations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Scheduling with Variable Profile and Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with small operator-non-availability periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with limited machine availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling with availability constraints to minimize total weighted completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling on identical parallel machines with machine disruptions to minimize total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:41, 21 July 2024

scientific article
Language Label Description Also known as
English
Single-machine common due date total earliness/tardiness scheduling with machine unavailability
scientific article

    Statements

    Single-machine common due date total earliness/tardiness scheduling with machine unavailability (English)
    0 references
    0 references
    0 references
    0 references
    22 January 2020
    0 references
    single-machine
    0 references
    earliness/tardiness
    0 references
    common due date
    0 references
    unrestrictive
    0 references
    machine unavailability
    0 references
    maintenance
    0 references
    resumable
    0 references
    semi-resumable
    0 references
    non-resumable
    0 references
    \( \mathcal{NP} \)-complete
    0 references
    dynamic programming
    0 references
    0 references
    0 references

    Identifiers

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