Pages that link to "Item:Q4147829"
From MaRDI portal
The following pages link to The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution (Q4147829):
Displayed 47 items.
- Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect (Q425519) (← links)
- A note on minimizing the sum of quadratic completion times on two identical parallel machines (Q456107) (← links)
- Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects (Q534925) (← links)
- Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect (Q611500) (← links)
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect (Q611619) (← links)
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology (Q611621) (← links)
- Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect (Q623223) (← links)
- Some single-machine scheduling problems with general effects of learning and deterioration (Q630729) (← links)
- Some single-machine scheduling with both learning and deterioration effects (Q639137) (← links)
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects (Q763108) (← links)
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- Parametric precedence relations in single machine scheduling (Q916560) (← links)
- Scheduling jobs on a single machine to maximize the total revenue of jobs (Q954056) (← links)
- A scheduling problem with job values given as a power function of their completion times (Q954933) (← links)
- Learning effect and deteriorating jobs in the single machine scheduling problems (Q965543) (← links)
- A note on single-machine scheduling with decreasing time-dependent job processing times (Q967802) (← links)
- Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning (Q969894) (← links)
- Sequencing jobs on a single machine with a common due data and stochastic processing times (Q1179194) (← links)
- A new lower bound approach for single-machine multicriteria scheduling (Q1198623) (← links)
- Solution of the generalized Townsend single machine scheduling model (Q1278202) (← links)
- General stochastic single-machine scheduling with regular cost functions (Q1381780) (← links)
- Generalized pairwise interchanges and machine scheduling (Q1388824) (← links)
- An improved precedence rule for single machine sequencing problems with quadratic penalty (Q1580988) (← links)
- Minimizing the weighted sum of squared tardiness on a single machine (Q1762060) (← links)
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
- Minimizing the sum of squares lateness on a single machine (Q1848630) (← links)
- Optimal sequences in stochastic single machine shops (Q1919778) (← links)
- Several single-machine scheduling problems with general learning effects (Q1930782) (← links)
- Single-machine scheduling with both deterioration and learning effects (Q2267309) (← links)
- Single machine scheduling with nonlinear cost functions (Q2277133) (← links)
- Algorithms for a class of single-machine weighted tardiness and earliness problems (Q2277355) (← links)
- Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times (Q2389069) (← links)
- Single-machine scheduling with general learning functions (Q2389734) (← links)
- Some scheduling problems with general position-dependent and time-dependent learning effects (Q2390362) (← links)
- Single machine scheduling with a general exponential learning effect (Q2428939) (← links)
- Single-machine scheduling problems with start-time dependent processing time (Q2519639) (← links)
- Single-machine scheduling problems with the time-dependent learning effect (Q2519645) (← links)
- Solving a stochastic single machine problem with initial idle time and quadratic objective (Q2655649) (← links)
- Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning (Q3561750) (← links)
- A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure (Q3778533) (← links)
- Single Machine Schednling Problem with Quadratic Function of Completion Times-A Modified Approach (Q3912340) (← links)
- The Sngle Machine Problem with Quadratic Penalty Function (Q3941175) (← links)
- A bicriterion scheduling problem involving total flowtime and total tardiness (Q4264495) (← links)
- A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness (Q4297161) (← links)
- Minimizing a Quadratic Function of Job Lateness in the Single Machine System (Q4298534) (← links)
- Single machine jobshop scheduling problem with weighted quadratic function of job lateness: A branch-and-bound approach (Q4718640) (← links)
- Single-machine scheduling with deteriorating jobs (Q4909259) (← links)
