The following pages link to (Q4821818):
Displaying 50 items.
- An overview of curriculum-based course timetabling (Q2355018) (← links)
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)
- Parallel multiobjective evolutionary algorithms for batch scheduling in heterogeneous computing and grid systems (Q2376128) (← links)
- Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations (Q2398648) (← links)
- Online scheduling of jobs with kind release times and deadlines on a single machine (Q2422652) (← links)
- A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking (Q2423281) (← links)
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine (Q2429059) (← links)
- A graph-based hyper-heuristic for educational timetabling problems (Q2432892) (← links)
- Scheduling jobs on parallel machines to minimize a regular step total cost function (Q2434254) (← links)
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
- The price of anarchy in an exponential multi-server (Q2457255) (← links)
- Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline (Q2459400) (← links)
- Greedy multiprocessor server scheduling (Q2466596) (← links)
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period (Q2467254) (← links)
- Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
- Best compromise solution for a new multiobjective scheduling problem (Q2489291) (← links)
- Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
- New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling (Q2503312) (← links)
- An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop (Q2512819) (← links)
- Revenue management for operations with urgent orders (Q2629651) (← links)
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling (Q2630226) (← links)
- A comparative study of solution representations for the unrelated machines environment (Q2664345) (← links)
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines (Q2664447) (← links)
- Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
- The efficiency-fairness balance of round robin scheduling (Q2670464) (← links)
- An iterative exact algorithm for the weighted fair sequences problem (Q2676411) (← links)
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- Scheduling uniform machines with restricted assignment (Q2688627) (← links)
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines (Q2693572) (← links)
- An improved algorithm for parallel machine scheduling under additional resource constraints (Q2693796) (← links)
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions (Q2699097) (← links)
- Online Optimization of Busy Time on Parallel Machines (Q2898056) (← links)
- Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines (Q2957687) (← links)
- Universal Packet Routing with Arbitrary Bandwidths and Transit Times (Q3009776) (← links)
- Ascents and descents in random trees (Q3078477) (← links)
- THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING (Q3144935) (← links)
- Multicriteria movement synchronization scheduling problems and algorithms (Q3165912) (← links)
- A Comparison of Random Task Graph Generation Methods for Scheduling Problems (Q3297563) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- Variants of Multi-resource Scheduling Problems with Equal Processing Times (Q3467836) (← links)
- Selfish Bin Packing (Q3541100) (← links)
- Scheduling to Maximize Participation (Q3608460) (← links)
- A MULTI-OBJECTIVE RISK-BASED FRAMEWORK FOR MISSION CAPABILITY PLANNING (Q3633963) (← links)
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
- Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
- Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem (Q4634982) (← links)
- Improved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover (Q4639895) (← links)
- Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time (Q4689382) (← links)
- Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery (Q4689384) (← links)
- On A Directed Tree Problem Motivated by A Newly Introduced Graph Product (Q5006563) (← links)