Pages that link to "Item:Q2268518"
From MaRDI portal
The following pages link to A Lagrangian approach to single-machine scheduling problems with two competing agents (Q2268518):
Displaying 37 items.
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263) (← links)
- Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
- A scheduling problem with three competing agents (Q337134) (← links)
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← links)
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time (Q339589) (← links)
- An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
- Single machine scheduling problem with two synergetic agents and piece-rate maintenance (Q350484) (← links)
- Single machine batch scheduling with two competing agents to minimize total flowtime (Q420859) (← links)
- A single-machine bi-criterion scheduling problem with two agents (Q482429) (← links)
- Two-agent single-machine scheduling problems under increasing linear deterioration (Q552491) (← links)
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
- A two-machine flowshop problem with two agents (Q709115) (← links)
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures (Q976483) (← links)
- Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities (Q1639885) (← links)
- A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
- A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms (Q1723459) (← links)
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
- Solving a two-agent single-machine scheduling problem considering learning effect (Q1762153) (← links)
- Approximation schemes for two-machine flow shop scheduling with two agents (Q1928514) (← links)
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times (Q2009966) (← links)
- Vehicle scheduling problems with two agents on a line (Q2099389) (← links)
- A survey of due-date related single-machine with two-agent scheduling problem (Q2190270) (← links)
- Online single-machine scheduling to minimize the linear combination of makespans of two agents (Q2234790) (← links)
- Two-agent single-machine scheduling with assignable due dates (Q2250186) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- Two-agent scheduling on a single machine with release dates (Q2273652) (← links)
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines (Q2311120) (← links)
- An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines (Q2317128) (← links)
- Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← links)
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine (Q2453274) (← links)
- SOME NONSTANDARD FEATURES OF BARGAINING PROBLEMS (Q2854006) (← links)
- SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN (Q3114615) (← links)
- Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem (Q5038175) (← links)
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621) (← links)
- An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain (Q6091879) (← links)
- A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem (Q6114936) (← links)
