The following pages link to Michael J. Magazine (Q1051421):
Displaying 40 items.
- (Q319063) (redirect page) (← links)
- The 2Bin system for controlling medical supplies at point-of-use (Q319065) (← links)
- (Q749437) (redirect page) (← links)
- Batch sizing and job sequencing on a single machine (Q749439) (← links)
- A heuristic algorithm for the multidimensional zero-one knapsack problem (Q789318) (← links)
- Heuristic approaches for batching jobs in printed circuit board assembly (Q868134) (← links)
- Batching in single operation manufacturing systems (Q1062613) (← links)
- A fully polynomial approximation algorithm for the 0-1 knapsack problem (Q1159134) (← links)
- Assembly line balancing as generalized bin packing (Q1167660) (← links)
- Comparison of neural and heuristic methods for a timetabling problem (Q1268158) (← links)
- Some remarks about the `equivalence' of performance measures in scheduling problems (Q1310028) (← links)
- Maximizing the value of a space mission (Q1342007) (← links)
- Minimizing maximum lateness with job families (Q1590808) (← links)
- Optimal block design models for course timetabling (Q1611993) (← links)
- Minimizing flowtime for paired tasks (Q1751895) (← links)
- The demand weighted vehicle routing problem (Q1754023) (← links)
- Buyer selection and service pricing in an electric fleet supply chain (Q2239895) (← links)
- Fast, Effective Algorithms for Simple Assembly Line Balancing Problems (Q3032068) (← links)
- Synchronous Unpaced Flow Lines with Worker Differences and Overtime Cost (Q3116744) (← links)
- Probabilistic Analysis of Bin Packing Heuristics (Q3343776) (← links)
- Firefighter Staffing Including Temporary Absences and Wastage (Q3391981) (← links)
- Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems (Q3621930) (← links)
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems (Q3706866) (← links)
- A Note on Approximation Schemes for Multidimensional Knapsack Problems (Q3718485) (← links)
- (Q3896813) (← links)
- An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints (Q3953531) (← links)
- A Closed-Form Solution To A Class Of Quadratic Knapsack Problems (Q4009107) (← links)
- When the Greedy Solution Solves a Class of Knapsack Problems (Q4062195) (← links)
- A Classified Bibliography of Research on Optimal Design and Control of Queues (Q4148781) (← links)
- Workforce Scheduling with Cyclic Demands and Day-Off Constraints (Q4149197) (← links)
- Throughput for production lines with serial work stations and parallel service facilities (Q4332069) (← links)
- (Q4499924) (← links)
- Push and pull strategies for controlling multistage production systems (Q4510489) (← links)
- Gated MaxWIP: A strategy for controlling multistage production systems (Q4807209) (← links)
- Note: Due-date Assignment to Multi-Job Customer Orders (Q4834347) (← links)
- A Stability Concept For Zero-One Knapsack Problems And Approximation Algorithms (Q4849260) (← links)
- Application of an Annealed Neural Network to a Timetabling Problem (Q5284218) (← links)
- Optimal control of multi‐channel service systems (Q5667349) (← links)
- Optimality of intuitive checkpointing policies (Q5902598) (← links)
- Optimality of intuitive checkpointing policies (Q5966432) (← links)
