Scheduling two agents with controllable processing times

DOI10.1016/j.ejor.2010.01.005zbMath1188.90114OpenAlexW1971501294MaRDI QIDQ976351

Sudheer R. Vakati, Guohua Wan, Joseph Y.-T. Leung, Michael L. Pinedo

Publication date: 11 June 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.01.005

zbMATH Keywords

total completion timemaximum latenesscontrollable processing timesagent schedulingavailability constraintsmaximum tardinessimprecise computation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (41)

Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent ⋮ Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop ⋮ Two-agent scheduling in a flowshop ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ Batch scheduling of identical jobs with controllable processing times ⋮ Single machine scheduling with interfering job sets ⋮ Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria ⋮ Two-agent singe-machine scheduling with release times to minimize the total weighted completion time ⋮ An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ Single machine scheduling problem with two synergetic agents and piece-rate maintenance ⋮ Scheduling with two competing agents to minimize total weighted earliness ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures ⋮ Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources ⋮ A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ⋮ Two-agent scheduling of time-dependent jobs ⋮ Two‐agent scheduling with linear resource‐dependent processing times ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ Single machine batch scheduling with two competing agents to minimize total flowtime ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ Bounded parallel-batching scheduling with two competing agents ⋮ Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms ⋮ Scheduling two agents with sum-of-processing-times-based deterioration on a single machine ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ A single-machine bi-criterion scheduling problem with two agents ⋮ Single machine resource allocation scheduling problems with deterioration effect and general positional effect ⋮ Two competitive agents to minimize the weighted total late work and the total completion time ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ Group Scheduling with Two Competing Agents on a Single Machine ⋮ A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times ⋮ A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion ⋮ Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria ⋮ An approximation algorithm for multi-agent scheduling on two uniform parallel machines ⋮ Two-agent integrated scheduling of production and distribution operations with fixed departure times ⋮ Due date assignment and two-agent scheduling under multitasking environment

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing mean weighted execution time loss on identical and uniform processors
• Pre-emptive scheduling problems with controllable processing times
• Minimizing the number of tardy job units under release time constraints
• Time-optimal control in a single machine problem with resource constraints
• A bicriterion approach to time/cost trade-offs in sequencing
• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• Single machine scheduling subject to deadlines and resource dependent processing times
• Minimization of the makespan in a two-machine problem under given resource constraints
• Two-machine flowshop scheduling with availability constraints
• Minimizing the weighted number of tardy task units
• Some comments on sequencing with controllable processing times
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
• Positive half-products and scheduling with controllable processing times
• Job-shop scheduling with resource-time models of operations
• A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
• A survey of scheduling with controllable processing times
• A multiple-criterion model for machine scheduling
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Scheduling with Deadlines and Loss Functions
• Competitive Two-Agent Scheduling and Its Applications
• Scheduling jobs with controllable processing times as an optimal control problem
• Algorithms for Scheduling Imprecise Computations with Timing Constraints
• Scheduling Problems with Two Competing Agents
• General flow-shop scheduling with resource constraints
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Single Machine Scheduling to Minimize Total Late Work
• Resource optimal control in some single-machine scheduling problems
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Single machine batch scheduling with resource dependent setup and processing times

This page was built for publication: Scheduling two agents with controllable processing times