Pages that link to "Item:Q339650"
From MaRDI portal
The following pages link to An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650):
Displaying 11 items.
- A tabu method for a two-agent single-machine scheduling with deterioration jobs (Q336450) (← links)
- Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times (Q474643) (← links)
- Two-agent single machine scheduling with forbidden intervals (Q902407) (← 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)
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225) (← 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 common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem (Q6114936) (← links)
