The following pages link to (Q4124328):
Displaying 50 items.
- Speed scaling for maximum lateness (Q255271) (← links)
- Integrated production and distribution scheduling problems related with fixed delivery departure dates and number of late orders (Q257796) (← links)
- A graph coloring approach to the deployment scheduling and unit assignment problem (Q283268) (← links)
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process (Q299834) (← links)
- Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
- Total completion time minimization on multiple machines subject to machine availability and makespan constraints (Q319146) (← links)
- Solving the traveling repairman problem on a line with general processing times and deadlines (Q319440) (← links)
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling (Q320651) (← links)
- An assignment-based lower bound for a class of two-machine flow shop problems (Q336351) (← links)
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) (← links)
- A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times (Q337074) (← links)
- A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan (Q337146) (← links)
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop (Q339585) (← links)
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time (Q339589) (← links)
- Finding optimal tour schedules on transportation paths under extended time window constraints (Q341462) (← links)
- Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) (← links)
- Acquisition planning and scheduling of computing resources (Q342569) (← links)
- A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
- Single machine total tardiness maximization problems: complexity and algorithms (Q367638) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors (Q380561) (← links)
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
- Developing feasible and optimal schedules of jobs on one machine (Q380659) (← links)
- Single machine batch scheduling with release times and delivery costs (Q398839) (← links)
- A note on reverse scheduling with maximum lateness objective (Q398863) (← links)
- An artificial bee colony algorithm for the job shop scheduling problem with random processing times (Q400942) (← links)
- Resource constraint scheduling with a fractional shared resource (Q408404) (← links)
- A hybrid differential evolution and tree search algorithm for the job shop scheduling problem (Q410367) (← links)
- Optimal results and numerical simulations for flow shop scheduling problems (Q410955) (← links)
- A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm (Q411034) (← links)
- Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis (Q421447) (← links)
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
- Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm (Q454950) (← links)
- Notes on inverse bin-packing problems (Q458387) (← links)
- Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times (Q474643) (← links)
- Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm (Q474788) (← links)
- A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration (Q483728) (← links)
- Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times (Q496647) (← links)
- Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Performance of the LPT algorithm in multiprocessor scheduling (Q583889) (← links)
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem (Q622145) (← links)
- Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates (Q632665) (← links)
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs (Q633558) (← links)
- Constraint programming approach to a bilevel scheduling problem (Q647473) (← links)
- Single machine scheduling with nonlinear lateness cost functions and fuzzy due dates (Q697023) (← links)
- Crane scheduling in container yards with inter-crane interference (Q707091) (← links)
