The following pages link to (Q3938812):
Displayed 50 items.
- KBSS: A knowledge-based system for scheduling in automated manufacturing (Q583088) (← links)
- Tradeoff between setup times and carrying costs for finished items (Q690011) (← links)
- Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times (Q706971) (← links)
- New directions in scheduling theory (Q786649) (← links)
- Branch and bound algorithm for the flow shop with multiple processors (Q809880) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Solving a concrete sleepers production scheduling by genetic algorithms (Q863974) (← links)
- Scheduling the truckload operations in automatic warehouses (Q863986) (← links)
- On the continuous working problem (Q917431) (← links)
- Single facility multi-class job scheduling (Q917435) (← links)
- Scheduling flexible machining and assembly systems (Q918383) (← links)
- Scheduling methods for a class of flexible manufacturing systems (Q918390) (← links)
- Multi-level production scheduling for a class of flexible machining and assembly systems (Q918393) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- The two-machine sequence dependent flowshop scheduling problem (Q1081528) (← links)
- Optimal schedules for single facility with two job classes (Q1085046) (← links)
- Scheduling on machines with variable service rates (Q1094326) (← links)
- Single facility scheduling with multiple job classes (Q1105481) (← links)
- New trends in machine scheduling (Q1107428) (← links)
- A survey of priority rule-based scheduling (Q1111923) (← links)
- Real-time scheduling of an automated manufacturing center (Q1116883) (← links)
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem (Q1120271) (← links)
- k-optimal solution sets for some polynomially solvable scheduling problems (Q1121169) (← links)
- Minimizing total tardiness in permutation flowshops (Q1127155) (← links)
- Optimal lot streaming for multiple products in a two-machine flow shop (Q1127157) (← links)
- Minimizing the number of tardy jobs for \(m\) parallel machines (Q1127174) (← links)
- Resource-constrained job scheduling with recyclable resources (Q1129908) (← links)
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem (Q1129955) (← links)
- Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
- A nonlinear mixed integer goal programming model for the two-machine closed flow shop (Q1183613) (← links)
- Production scheduling problems in a textile industry (Q1194728) (← links)
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem (Q1197881) (← links)
- Scheduling with neural networks -- the case of the Hubble Space Telescope (Q1200817) (← links)
- Use of variable range in solving multiple criteria scheduling problems (Q1200841) (← links)
- Flow-shops with a dominant machine (Q1203800) (← links)
- A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions (Q1207198) (← links)
- Capacitated two-parallel machines scheduling to minimize sum of job completion times (Q1208482) (← links)
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops (Q1260741) (← links)
- Establishment of economic production rate, production batch size, and production sequence in manufacturing systems with flexible routing (Q1261323) (← links)
- A computational study of constraint satisfaction for multiple capacitated job shop scheduling (Q1266543) (← links)
- An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem (Q1266548) (← links)
- Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine (Q1266653) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- A simulated annealing approach for the one-machine mean tardiness scheduling problem (Q1268192) (← links)
- Scheduling multiprocessor tasks with chain constraints (Q1278298) (← links)
- Sequencing jobs for an automated manufacturing module with buffer (Q1278543) (← links)
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs (Q1280126) (← links)
- Heuristic for scheduling in a Kanban system with dual blocking mechanisms (Q1280177) (← links)
- The complexity of multidimensional periodic scheduling (Q1281399) (← links)
- Scheduling installations in the telecommunications industry (Q1291579) (← links)