The following pages link to (Q3940839):
Displaying 50 items.
- Two parallel machines problem with job delivery coordination and availability constraint (Q256680) (← links)
- A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots (Q336565) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- Scheduling linearly shortening jobs under precedence constraints (Q552447) (← links)
- Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096) (← links)
- Performance of the LPT algorithm in multiprocessor scheduling (Q583889) (← links)
- Improving the preemptive bound for the single machine dynamic maximum lateness problem (Q614050) (← links)
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley'' (Q707768) (← links)
- New directions in scheduling theory (Q786649) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Scheduling of project networks (Q908839) (← links)
- Minimizing mean flow time with release time constraint (Q914352) (← links)
- Job oriented production scheduling (Q915631) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
- Efficient scheduling algorithms for a single batch processing machine (Q1077325) (← links)
- A block approach for single-machine scheduling with release dates and due dates (Q1083026) (← links)
- Scheduling tasks on two processors with deadlines and additional resources (Q1084012) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- Scheduling with semaphore constraints (Q1096534) (← links)
- Multiprocessor scheduling with interprocessor communication delays (Q1102743) (← links)
- S3 sets. An extension of the Beale-Tomlin special ordered sets (Q1102852) (← links)
- On a scheduling problem where a job can be executed only by a limited number of processors (Q1104235) (← links)
- New trends in machine scheduling (Q1107428) (← links)
- Real-time scheduling of an automated manufacturing center (Q1116883) (← links)
- Resource-constrained job scheduling with recyclable resources (Q1129908) (← links)
- Minimizing late jobs in the general one machine scheduling problem (Q1130035) (← links)
- A procedure for the one-machine sequencing problem with dependent jobs (Q1130073) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- Permutation vs. non-permutation flow shop schedules (Q1180831) (← links)
- A time indexed formulation of non-preemptive single machine scheduling problems (Q1196724) (← links)
- A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling (Q1210221) (← links)
- Two branch and bound algorithms for the permutation flow shop problem (Q1266538) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Scheduling jobs on parallel machines with sequence-dependent setup times (Q1278125) (← links)
- Sevast'yanov's algorithm for the flow-shop scheduling problem (Q1278200) (← links)
- Single machine scheduling with batch deliveries (Q1278307) (← links)
- Scheduling in robotic cells: Complexity and steady state analysis (Q1296691) (← links)
- A variant of time minimizing assignment problem (Q1303581) (← links)
- Flowshop scheduling with identical jobs and uniform parallel machines (Q1303728) (← links)
- The complexity of scheduling jobs in repetitive manufacturing systems (Q1310021) (← links)
- Performance of scheduling algorithms for no-wait flowshops with parallel machines (Q1310022) (← links)
- A polynomial algorithm for a multi-item capacitated production planning problem (Q1316097) (← links)
- Open shops with jobs overlap (Q1319530) (← links)
- A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem (Q1319570) (← links)
- Feasibility of scheduling lot sizes of two frequencies on one machine (Q1331610) (← links)
- Nonclairvoyant scheduling (Q1331961) (← links)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- ``PLATE'': A decision support system for resource constrained scheduling problems (Q1342047) (← links)
- A network flow algorithm for just-in-time project scheduling (Q1342048) (← links)
