The following pages link to (Q3525911):
Displaying 50 items.
- A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function (Q693656) (← links)
- Parallel-machine scheduling with deteriorating jobs and rejection (Q708217) (← links)
- A two-machine flowshop problem with two agents (Q709115) (← links)
- An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production (Q709140) (← links)
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness (Q711284) (← links)
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations (Q730961) (← links)
- Algorithms for a realistic variant of flowshop scheduling (Q732880) (← links)
- Group shops scheduling with makespan criterion subject to random release dates and processing times (Q733535) (← links)
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects (Q763108) (← links)
- Preemptive repayment policy for multiple loans (Q763209) (← links)
- A job shop scheduling heuristic for varying reward structures (Q815476) (← links)
- Optimality region for job permutation in single-machine scheduling with uncertain processing times (Q827990) (← links)
- Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns (Q829166) (← links)
- Scheduling identical parallel machines and operators within a period based changing mode (Q833547) (← links)
- Scheduling for stability in single-machine production systems (Q835553) (← links)
- Single-machine scheduling to stochastically minimize maximum lateness (Q835562) (← links)
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling (Q835569) (← links)
- Graph colouring approaches for a satellite range scheduling problem (Q835607) (← links)
- Sequencing unreliable jobs on parallel machines (Q835638) (← links)
- Parallel-machine scheduling of simple linear deteriorating jobs (Q837167) (← links)
- A subgradient descent algorithm for optimization of initially controllable flow shop systems (Q839014) (← links)
- Permutation-induced acyclic networks for the job shop scheduling problem (Q840194) (← links)
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations (Q845319) (← links)
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed (Q852963) (← links)
- A fuzzy logic based production scheduling/rescheduling in the presence of uncertain disruptions (Q853448) (← links)
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness (Q856204) (← links)
- Single machine scheduling under market uncertainty (Q856210) (← links)
- Optimal preemptive scheduling on uniform machines with discounted flowtime objectives (Q856258) (← links)
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (Q857354) (← links)
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (Q858325) (← links)
- An effective architecture for learning and evolving flexible job-shop schedules (Q858446) (← links)
- On no-wait and no-idle flow shops with makespan criterion (Q859679) (← links)
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem (Q872264) (← links)
- Scheduling parallel CNC machines with time/cost trade-off considerations (Q875425) (← links)
- Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times (Q878582) (← links)
- A discrete version of particle swarm optimization for flowshop scheduling problems (Q878589) (← links)
- Minimizing makespan with multiple-orders-per-job in a two-machine flowshop (Q879285) (← links)
- Two-machine stochastic flow shops with blocking and the traveling salesman problem (Q880520) (← links)
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
- Two machine scheduling under disruptions with transportation considerations (Q880527) (← links)
- A note on the complexity of the concurrent open shop problem (Q880556) (← links)
- Single-machine scheduling with general costs under compound-type distributions (Q880581) (← links)
- Scheduling orders for multiple product types to minimize total weighted completion time (Q881573) (← links)
- Considering scheduling and preventive maintenance in the flowshop sequencing problem (Q883296) (← links)
- A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines (Q892903) (← links)
- Note on ``Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time'' (Q903600) (← links)
- Heuristic algorithms for two machine re-entrant flow shop (Q930923) (← links)
