The following pages link to (Q4124328):
Displaying 50 items.
- A two-machine flowshop problem with two agents (Q709115) (← links)
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment (Q709154) (← links)
- Analysis of the similarities and differences of job-based scheduling problems (Q723975) (← links)
- Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem (Q725705) (← links)
- Solving scheduling and location problems in the plane simultaneously (Q732883) (← links)
- Optimal solutions for a dock assignment problem with trailer transportation (Q744629) (← links)
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results (Q744660) (← links)
- The Pareto frontier of inefficiency in mechanism design (Q777959) (← links)
- Effective optimization methods for single-machine scheduling (survey) (Q786645) (← links)
- New directions in scheduling theory (Q786649) (← links)
- Algorithms for two-machine flow-shop sequencing with precedence constraints (Q800822) (← links)
- Linear programming models for load balancing (Q810365) (← links)
- The coordination of scheduling and batch deliveries (Q816348) (← links)
- Online production planning to maximize the number of on-time orders (Q829183) (← links)
- Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
- Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
- Effective on-line algorithms for reliable due date quotation and large-scale scheduling (Q835600) (← links)
- Minimizing the stretch when scheduling flows of divisible requests (Q835622) (← links)
- New single machine and job-shop scheduling problems with availability constraints (Q880500) (← links)
- Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
- Two-machine interval shop scheduling with time lags (Q892834) (← links)
- A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines (Q892903) (← links)
- Optimal control of a two-server flow-shop network (Q892910) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
- On the continuous working problem (Q917431) (← links)
- A controlled search simulated annealing method for the single machine weighted tardiness problem (Q918386) (← links)
- Approximation results in parallel machines stochastic scheduling (Q922283) (← links)
- Reducibility among single machine weighted completion time scheduling problems (Q922287) (← links)
- Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times (Q947867) (← links)
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (Q958450) (← links)
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (Q969755) (← links)
- A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates (Q976008) (← links)
- A decomposition scheme for single stage scheduling problems (Q983632) (← links)
- Complexity of single machine scheduling subject to nonnegative inventory constraints (Q992655) (← links)
- The one-machine just-in-time scheduling problem with preemption (Q1013290) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness (Q1038111) (← links)
- Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates (Q1044134) (← links)
- Some no-wait shops scheduling problems: Complexity aspect (Q1079487) (← links)
- On a scheduling problem where a job can be executed only by a limited number of processors (Q1104235) (← links)
- The two-machine flowshop scheduling problem with total tardiness (Q1115798) (← links)
- Scheduling algorithms based on necessary optimality conditions (Q1116885) (← links)
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty (Q1121167) (← links)
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (Q1121783) (← links)
- General approximation algorithms for some arithmetical combinatorial problems (Q1158970) (← links)
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time (Q1171502) (← links)
- Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
- A time indexed formulation of non-preemptive single machine scheduling problems (Q1196724) (← links)
