Scheduling two agents with controllable processing times (Q976351): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling Problems with Two Competing Agents / 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: Q3680271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing mean weighted execution time loss on identical and uniform processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource optimal control in some single-machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriterion Single Machine Scheduling with Resource Dependent Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine batch scheduling with resource dependent setup and processing times / 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: Multi-agent scheduling on a single machine with max-form criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling with resource-time models of operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of tardy job units under release time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some comments on sequencing with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-optimal control in a single machine problem with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3775317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General flow-shop scheduling with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of the makespan in a two-machine problem under given resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling subject to deadlines and resource dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive half-products and scheduling with controllable processing times / 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: Competitive Two-Agent Scheduling and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the weighted number of tardy task units / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with controllable processing times as an optimal control problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling to Minimize Total Late Work / 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: Algorithms for Scheduling Imprecise Computations with Timing Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pre-emptive scheduling problems with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion approach to time/cost trade-offs in sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. / rank
 
Normal rank

Latest revision as of 22:43, 2 July 2024

scientific article
Language Label Description Also known as
English
Scheduling two agents with controllable processing times
scientific article

    Statements

    Scheduling two agents with controllable processing times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 June 2010
    0 references
    0 references
    agent scheduling
    0 references
    controllable processing times
    0 references
    availability constraints
    0 references
    imprecise computation
    0 references
    total completion time
    0 references
    maximum tardiness
    0 references
    maximum lateness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references