The following pages link to Wiesław X. Kubiak (Q1575602):
Displayed 50 items.
- (Q224834) (redirect page) (← links)
- Scheduling chains to minimize mean flow time (Q290213) (← links)
- Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs (Q293435) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines (Q600836) (← links)
- A half-product based approximation scheme for agreeably weighted completion time variance (Q707130) (← links)
- An efficient algorithm for finding ideal schedules (Q766186) (← links)
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing (Q880504) (← links)
- Response time variability (Q880584) (← links)
- Scheduling semi-malleable jobs to minimize mean flow time (Q892832) (← links)
- Decentralized subcontractor scheduling with divisible jobs (Q892907) (← links)
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (Q915632) (← links)
- Proportional optimization and fairness (Q947706) (← links)
- Apportionment methods and the Liu-Layland problem (Q954936) (← links)
- A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (Q969520) (← links)
- A coordinating contract for transshipment in a two-company supply chain (Q992601) (← links)
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298) (← links)
- Mathematical programming modeling of the response time variability problem (Q1042486) (← links)
- (Q1084856) (redirect page) (← links)
- Minimizing mean flow time with parallel processors and resource constraints (Q1084859) (← links)
- Proof of a conjecture of Schrage about the completion time variance problem (Q1183389) (← links)
- Total completion time minimization in two-machine job shops with unit-time operations (Q1278312) (← links)
- On the complexity of a restricted list-coloring problem (Q1296975) (← links)
- Completion time variance minimization on a single machine is difficult (Q1317023) (← links)
- Complexity of a class of nonlinear combinatorial problems related to their linear counterparts (Q1328652) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- Optimal level schedules for mixed-model, multi-level just-in-time assembly systems (Q1357784) (← links)
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs (Q1388066) (← links)
- Complexity of one-cycle robotic flow-shops (Q1404271) (← links)
- Cyclic just-in-time sequences are optimal (Q1407256) (← links)
- Scheduling preemptable tasks on parallel processors with limited availability (Q1575603) (← links)
- Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability (Q1578308) (← links)
- Fast fully polynomial approximation schemes for minimizing completion time variance (Q1600838) (← links)
- Tree precedence in scheduling: The strong-weak distinction (Q1606979) (← links)
- Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
- Shared multi-processor scheduling (Q1753597) (← links)
- Minimization of ordered, symmetric half-products (Q1763481) (← links)
- Positive half-products and scheduling with controllable processing times (Q1772845) (← links)
- Asymptotic behavior of optimal quantities in symmetric transshipment coalitions (Q1785277) (← links)
- Algorithms for minimizing maximum lateness with unit length tasks and resource constraints (Q1803669) (← links)
- New results on the completion time variance minimization (Q1805454) (← links)
- Scheduling parallel tasks with sequential heads and tails (Q1808180) (← links)
- Scheduling chains on uniform processors with communication delays (Q1860371) (← links)
- On small deviations conjecture (Q1885390) (← links)
- Scheduling shops to minimize the weighted number of late jobs (Q1890952) (← links)
- An efficient algorithm for a job shop problem (Q1897385) (← links)
- Scheduling identical jobs with chain precedence constraints on two uniform machines (Q1974574) (← links)
- On a conjecture for the university timetabling problem (Q2028068) (← links)
- Shared processor scheduling of multiprocessor jobs (Q2282535) (← links)