Pages that link to "Item:Q339589"
From MaRDI portal
The following pages link to Two-agent singe-machine scheduling with release times to minimize the total weighted completion time (Q339589):
Displaying 20 items.
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling (Q320651) (← links)
- A tabu method for a two-agent single-machine scheduling with deterioration jobs (Q336450) (← links)
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
- Competitive two-agent scheduling with learning effect and release times on a single machine (Q474086) (← links)
- A single-machine bi-criterion scheduling problem with two agents (Q482429) (← links)
- Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent (Q827243) (← links)
- A lower bound for minimizing the total completion time of a three-agent scheduling problem (Q1671716) (← links)
- A two-agent single-machine scheduling problem to minimize the total cost with release dates (Q1701559) (← links)
- A note on two-agent scheduling with resource dependent release times on a single machine (Q1723365) (← 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)
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times (Q2009966) (← links)
- A survey of due-date related single-machine with two-agent scheduling problem (Q2190270) (← links)
- A Lagrangian approach to single-machine scheduling problems with two competing agents (Q2268518) (← links)
- Two-agent scheduling on a single machine with release dates (Q2273652) (← links)
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← links)
- Scheduling with two competing agents to minimize total weighted earliness (Q2399317) (← links)
- Two-agent vehicle scheduling problem on a line-shaped network (Q2691417) (← links)
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (Q5058765) (← links)
