The following pages link to (Q3525910):
Displaying 50 items.
- Two parallel machines problem with job delivery coordination and availability constraint (Q256680) (← links)
- An improved two-machine flowshop scheduling with intermediate transportation (Q266074) (← links)
- Batch scheduling with deadlines on parallel machines: an NP-hard case (Q287238) (← links)
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182) (← links)
- A holonic approach to flexible flow shop scheduling under stochastic processing times (Q336906) (← links)
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
- A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
- Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity (Q339549) (← links)
- A heuristic method for two-stage hybrid flow shop with dedicated machines (Q339604) (← links)
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
- Evaluation of mathematical models for flexible job-shop scheduling problems (Q350406) (← links)
- On multiprocessor temperature-aware scheduling problems (Q398885) (← links)
- Optimization models for assessing the peak capacity utilization of intelligent transportation systems (Q421745) (← links)
- Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect (Q425519) (← links)
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization (Q429692) (← links)
- Improving fleet utilization for carriers by interval scheduling (Q439488) (← links)
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504) (← links)
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
- Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects (Q534925) (← links)
- Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
- Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects'' (Q545340) (← links)
- A network flow model of group technology (Q597530) (← links)
- A cooperative hyper-heuristic search framework (Q604941) (← links)
- Some single-machine scheduling problems with general effects of learning and deterioration (Q630729) (← links)
- Two-machine flowshop scheduling with intermediate transportation under job physical space consideration (Q632667) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- Distributed algorithmic mechanism design for scheduling on unrelated machines (Q635328) (← links)
- Extended beam search for non-exhaustive state space analysis (Q652163) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Scheduling and constraint propagation (Q697570) (← links)
- Manufacturing lead-time rules: customer retention versus tardiness costs (Q706883) (← links)
- Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells (Q706905) (← links)
- Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
- A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem (Q725705) (← links)
- Throughput-optimal sequences for cyclically operated plants (Q732253) (← links)
- A contribution and new heuristics for open shop scheduling (Q733548) (← links)
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122) (← links)
- On a fix-and-relax framework for a class of project scheduling problems (Q817205) (← links)
- A tabu search heuristic for the quay crane scheduling problem (Q835567) (← links)
- Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities (Q835585) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs (Q850246) (← links)
- Necessary and sufficient conditions of optimality for some classical scheduling problems (Q852941) (← links)
- A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem (Q853075) (← links)
- Cyclic multiple-robot scheduling with time-window constraints using a critical path approach (Q856208) (← links)
- Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time (Q861201) (← links)
