Pages that link to "Item:Q5668250"
From MaRDI portal
The following pages link to Optimal Sequencing of a Single Machine Subject to Precedence Constraints (Q5668250):
Displaying 50 items.
- Approximability of scheduling problems with resource consuming jobs (Q256641) (← links)
- Single-machine bicriterion group scheduling with deteriorating setup times and job processing times (Q279548) (← links)
- Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
- Parallel-machine scheduling with release dates and rejection (Q295880) (← links)
- Lawler's minmax cost algorithm: optimality conditions and uncertainty (Q309059) (← links)
- Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
- Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
- Optimal restricted due date assignment in scheduling (Q322834) (← links)
- Single machine scheduling problem with two synergetic agents and piece-rate maintenance (Q350484) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- A note on reverse scheduling with maximum lateness objective (Q398863) (← links)
- Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost (Q457296) (← links)
- Performance guarantees for a scheduling problem with common stepwise job payoffs (Q476886) (← links)
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (Q477611) (← links)
- A note: minimizing maximum earliness on a proportionate flowshop (Q477650) (← links)
- Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem (Q490323) (← links)
- Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Scheduling problems with partially ordered jobs (Q612206) (← links)
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
- Minimizing the number of tardy jobs in single machine sequencing (Q686166) (← links)
- Scheduling with bully selfish jobs (Q692928) (← links)
- Solving scheduling and location problems in the plane simultaneously (Q732883) (← links)
- Two-agent scheduling on uniform parallel machines with min-max criteria (Q744634) (← links)
- Isomorphic scheduling problems (Q744639) (← links)
- Effective optimization methods for single-machine scheduling (survey) (Q786645) (← links)
- Optimal assignment of slack due-date and sequencing in a single machine shop (Q803030) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Scheduling problems with a weight-modifying-activity (Q828829) (← links)
- Minimizing the number of late jobs in a stochastic setting using a chance constraint (Q835575) (← links)
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness (Q856204) (← links)
- A 2-OPT procedure to reduce total inspection time in a serial inspection process (Q877228) (← links)
- Pareto minimizing total completion time and maximum cost with positional due indices (Q888315) (← links)
- Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553) (← links)
- Probabilistic single processor scheduling (Q912611) (← links)
- A faster algorithm for the maximum weighted tardiness problem (Q916393) (← links)
- Optimal assignment of slack due-dates and sequencing in a single-machine shop (Q917429) (← links)
- Complexity of single machine scheduling problems under scenario-based uncertainty (Q943794) (← links)
- Single-machine scheduling under the job rejection constraint (Q964407) (← links)
- The counting complexity of a simple scheduling problem (Q1038110) (← links)
- Single machine scheduling with release dates and rejection (Q1042081) (← links)
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure (Q1042153) (← links)
- Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem (Q1120271) (← links)
- An algorithm for single machine sequencing with release dates to minimize maximum cost (Q1121165) (← links)
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty (Q1121167) (← links)
- k-optimal solution sets for some polynomially solvable scheduling problems (Q1121169) (← links)
- Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
- Sequencing with general precedence constraints (Q1142151) (← links)
- On the measurement of complexity in activity networks (Q1145062) (← links)
