Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343): 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.dam.2010.02.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087681531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling the Open Shop to Minimize Mean Flow Time / 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: Minimizing Mean Squared Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a due-date assignment on a two-machine flow-shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling and common due-date assignment on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: A survey of the state-of-the-art of common due date assignment and scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667087 / 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: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Minimizing Average Flow Time with Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling to minimize costs for earliness and number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for minimizing the total weighted tardiness on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling problems with a modified total weighted tardiness objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / 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: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due date assignments and scheduling a single machine with a general earliness/tardiness cost function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two due date assignment problems in scheduling a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal due date assignment in multi-machine scheduling environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manufacturing lead-time rules: customer retention versus tardiness costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a bicriterion scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4034337 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:13, 3 July 2024

scientific article
Language Label Description Also known as
English
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
scientific article

    Statements

    Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (English)
    0 references
    0 references
    0 references
    0 references
    11 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    bicriteria scheduling
    0 references
    due date assignment
    0 references
    maximum tardiness
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references