The following pages link to (Q3525911):
Displaying 50 items.
- Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
- A multi-agent based cooperative approach to scheduling and routing (Q323308) (← links)
- Timing order fulfillment of capital goods under a constrained capacity (Q333100) (← links)
- Several flow shop scheduling problems with truncated position-based learning effect (Q336658) (← links)
- Emergency railway wagon scheduling by hybrid biogeography-based optimization (Q336873) (← links)
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- Flowshop scheduling with a general exponential learning effect (Q336933) (← links)
- Minimizing the total completion time in a distributed two stage assembly system with setup times (Q337027) (← links)
- Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects (Q337503) (← links)
- An order scheduling problem with position-based learning effect (Q342484) (← links)
- Acquisition planning and scheduling of computing resources (Q342569) (← links)
- Single-machine scheduling with precedence constraints and position-dependent processing times (Q350351) (← links)
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
- The expected asymptotical ratio for preemptive stochastic online problem (Q391147) (← links)
- Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times (Q395848) (← links)
- Scheduling jobs with truncated exponential learning functions (Q395856) (← links)
- Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times (Q418297) (← links)
- Two-machine flow shop scheduling problem with an outsourcing option (Q421578) (← links)
- Discrete-time, economic lot scheduling problem on multiple, non-identical production lines (Q421620) (← links)
- Berth allocation with time-dependent physical limitations on vessels (Q421704) (← links)
- Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups (Q428876) (← links)
- Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
- Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time (Q433105) (← links)
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458) (← links)
- A revision of some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations (Q454887) (← links)
- A single-machine bi-criterion scheduling problem with two agents (Q482429) (← links)
- General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach (Q497626) (← links)
- Single-machine scheduling with two competing agents and learning consideration (Q497627) (← links)
- Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling (Q508765) (← links)
- A revision of machine scheduling problems with a general learning effect (Q534844) (← links)
- On robust online scheduling algorithms (Q539452) (← links)
- Scheduling deteriorating jobs on a single machine subject to breakdowns (Q539453) (← links)
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- Quantifying heuristics in the ordinal optimization framework (Q609560) (← links)
- Single-machine scheduling problems with both deteriorating jobs and learning effects (Q611502) (← links)
- Minimizing total weighted completion time with uncertain data: a stability approach (Q612208) (← links)
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
- Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness (Q613514) (← links)
- Greedy scheduling with custom-made objectives (Q613772) (← links)
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032) (← links)
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
- Scheduling UET-UCT tasks: Branch-and-bound search in the priority space (Q622602) (← links)
- Scheduling problems with general effects of deterioration and learning (Q632713) (← links)
- Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming (Q633553) (← links)
- Some single-machine scheduling with both learning and deterioration effects (Q639137) (← links)
- Single-machine due-window assignment problem with learning effect and deteriorating jobs (Q639174) (← links)
- Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness (Q639194) (← links)
- Scheduling with job-dependent learning effects and multiple rate-modifying activities (Q656606) (← links)
