A multiple-criterion model for machine scheduling
From MaRDI portal
Publication:2464375
Recommendations
Cited in
(only showing first 100 items - show all)- Scheduling interfering job sets on parallel machines
- Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
- Complexities of four problems on two-agent scheduling
- Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness
- A lower bound for minimizing the total completion time of a three-agent scheduling problem
- Two-agent parallel-machine scheduling with rejection
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- 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
- Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost
- A note on two-agent scheduling with resource dependent release times on a single machine
- A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms
- Two-agent scheduling to minimize the maximum cost with position-dependent jobs
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
- Competitive multi-agent scheduling with an iterative selection rule
- Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Solving a two-agent single-machine scheduling problem considering learning effect
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- Approximation schemes for two-machine flow shop scheduling with two agents
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- Two-agent single-machine scheduling with cumulative deterioration
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Complexities of some problems on multi-agent scheduling on a single machine
- Single machine batch scheduling with two non-disjoint agents and splitable jobs
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Two-agent integrated scheduling of production and distribution operations with fixed departure times
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
- The price of fairness for a two-agent scheduling game minimizing total completion time
- Due date assignment and two-agent scheduling under multitasking environment
- Vehicle scheduling problems with two agents on a line
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Pareto-scheduling of two competing agents with their own equal processing times
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
- Routing and scheduling problems with two agents on a line-shaped network
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
- A survey of due-date related single-machine with two-agent scheduling problem
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Serial-batching scheduling with two agents to minimize makespan and maximum cost
- Scheduling two projects with controllable processing times in a single-machine environment
- A just-in-time scheduling problem with two competing agents
- Online single-machine scheduling to minimize the linear combination of makespans of two agents
- 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
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- Two-agent scheduling on a single machine with release dates
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design
- Two-agent scheduling with rejection on a single machine
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
- Two agent scheduling with a central selection mechanism
- Scheduling two agent task chains with a central selection mechanism
- A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines
- Scheduling with two competing agents to minimize total weighted earliness
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Two-agent scheduling of time-dependent jobs
- Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
- A note on a two-agent scheduling problem related to the total weighted late work
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- Single-machine multi-agent scheduling problems with a global objective function
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Multicriteria scheduling
- A multi-period machine assignment problem
- Scheduling with competing agents, total late work and job rejection
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- A single-machine two-agent scheduling problem by GA approach
- Scheduling two-agents with a time-dependent deterioration to minimize the minsum earliness measures
- Batching machine scheduling with bicriteria: maximum cost and makespan
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
- Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
- Single machine family scheduling with two competing agents to minimize makespan
- Single machine scheduling with two competing agents and equal job processing times
- Practical solutions for a dock assignment problem with trailer transportation
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
- Two-agent scheduling in a flowshop
- Scheduling two job families on a single machine with two competitive agents
- Mathematical Modeling of Scheduling Problems
- A tabu method for a two-agent single-machine scheduling with deterioration jobs
- Single machine scheduling with interfering job sets
- A scheduling problem with three competing agents
- Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
This page was built for publication: A multiple-criterion model for machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464375)
