Pages that link to "Item:Q1762153"
From MaRDI portal
The following pages link to Solving a two-agent single-machine scheduling problem considering learning effect (Q1762153):
Displaying 18 items.
- A tabu method for a two-agent single-machine scheduling with deterioration jobs (Q336450) (← links)
- Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models (Q336999) (← links)
- Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria (Q337198) (← links)
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← links)
- An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
- Flowshop scheduling problems with a position-dependent exponential learning effect (Q474618) (← links)
- Improved DE search for competing groups scheduling with deterioration effects (Q828669) (← links)
- Scheduling with job-splitting considering learning and the vital-few law (Q1652529) (← 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)
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance (Q2012897) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- A multi-agent system for the weighted earliness tardiness parallel machine problem (Q2257353) (← links)
- Less is more approach for competing groups scheduling with different learning effects (Q2292126) (← links)
- Scheduling with two competing agents to minimize total weighted earliness (Q2399317) (← links)
- Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit (Q5223044) (← links)
- (Q6097273) (← links)