Scheduling two agents with controllable processing times
From MaRDI portal
Publication:976351
DOI10.1016/J.EJOR.2010.01.005zbMATH Open1188.90114OpenAlexW1971501294MaRDI QIDQ976351FDOQ976351
Authors: Guohua Wan, Sudheer Vakati, 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
Recommendations
- Competitive two-agent scheduling and its applications
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- Scheduling Problems with Two Competing Agents
- Just-in-time scheduling with controllable processing times on parallel machines
- Scheduling two projects with controllable processing times in a single-machine environment
maximum latenesstotal completion timeagent schedulingcontrollable processing timesavailability constraintsmaximum tardinessimprecise computation
Cites Work
- Title not available (Why is that?)
- 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
- 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
- Competitive two-agent scheduling and its applications
- Scheduling Problems with Two Competing Agents
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Scheduling with deadlines and loss functions
- Single machine batch scheduling with resource dependent setup and processing times
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Two-machine flowshop scheduling with availability constraints
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Minimizing the number of tardy job units under release time constraints
- A bicriterion approach to time/cost trade-offs in sequencing
- Single machine scheduling subject to deadlines and resource dependent processing times
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- Scheduling jobs with controllable processing times as an optimal control problem
- Pre-emptive scheduling problems with controllable processing times
- Title not available (Why is that?)
- Single Machine Scheduling to Minimize Total Late Work
- Job-shop scheduling with resource-time models of operations
- Minimizing mean weighted execution time loss on identical and uniform processors
- Time-optimal control in a single machine problem with resource constraints
- Resource optimal control in some single-machine scheduling problems
- Title not available (Why is that?)
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- Minimization of the makespan in a two-machine problem under given resource constraints
- Minimizing the weighted number of tardy task units
- Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
- General flow-shop scheduling with resource constraints
- Title not available (Why is that?)
Cited In (45)
- Two-agent single-machine scheduling with assignable due dates
- Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent
- A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Scheduling two projects with controllable processing times in a single-machine environment
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Scheduling two-agents with a time-dependent deterioration to minimize the minsum earliness measures
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
- Two competitive agents to minimize the weighted total late work and the total completion time
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Scheduling with two competing agents to minimize total weighted earliness
- Two-agent scheduling of time-dependent jobs
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines
- Scheduling two job families on a single machine with two competitive agents
- A batch scheduling problem with two agents
- Group Scheduling with Two Competing Agents on a Single Machine
- Two-agent scheduling in a flowshop
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- Two‐agent scheduling with linear resource‐dependent processing times
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- 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
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
- 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 problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- A two-agent single-machine scheduling problem with late work criteria
- Two-agent integrated scheduling of production and distribution operations with fixed departure times
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- A single-machine bi-criterion scheduling problem with two agents
- Bounded parallel-batching scheduling with two competing agents
- Unbounded parallel-batching scheduling with two competitive agents
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine
- Two-agent single-scheduling problems of proportionally-linear deteriorated jobs with the maxi-and-total cost criteria
- Two-agent single-machine scheduling with release dates to minimize the makespan
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- Due date assignment and two-agent scheduling under multitasking environment
- Single machine resource allocation scheduling problems with deterioration effect and general positional effect
This page was built for publication: Scheduling two agents with controllable processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976351)
