Scheduling two projects with controllable processing times in a single-machine environment (Q2215194): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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-020-00658-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3036795801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiagent Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Problems with Two Competing Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-agent single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive scheduling problem and its relevance to UMTS channel assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiple-criterion model for machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with trade-off between number of tardy jobs and resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to minimize the total compression and late costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Path Problems with Concave Cost-Time Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Network Flow Computation for Project Cost Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine just‐in‐time scheduling problems with two competing agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling for New Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with trade-off between number of tardy jobs and compression cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical-Path Planning and Scheduling: Mathematical Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Two-Agent Scheduling and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Crashing and Overlapping in Product Development / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total tardiness on a single machine with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling two agents with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>CON</i>/<i>SLK</i> due date assignment and scheduling on a single machine with two agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents / rank
 
Normal rank

Latest revision as of 05:02, 24 July 2024

scientific article
Language Label Description Also known as
English
Scheduling two projects with controllable processing times in a single-machine environment
scientific article

    Statements

    Scheduling two projects with controllable processing times in a single-machine environment (English)
    0 references
    0 references
    0 references
    11 December 2020
    0 references
    scheduling
    0 references
    two-agent sequencing
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers