The following pages link to Ching-Jong Liao (Q418294):
Displaying 36 items.
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times (Q418297) (← links)
- Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups (Q428876) (← links)
- A linear programming approach to the electricity contract capacity problem (Q639186) (← links)
- Tradeoff between setup times and carrying costs for finished items (Q690011) (← links)
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups (Q868130) (← links)
- A discrete version of particle swarm optimization for flowshop scheduling problems (Q878589) (← links)
- A discrete particle swarm optimization for lot-streaming flowshop scheduling problem (Q933507) (← links)
- Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
- Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
- Minimizing the sum of job completion times on capacitated two-parallel machines (Q1014943) (← links)
- A heuristic for determining the optimal order in a tandem queue (Q1186002) (← links)
- Use of variable range in solving multiple criteria scheduling problems (Q1200841) (← links)
- An inventory system with multiple replenishment scheduling (Q1342087) (← links)
- A new node selection strategy in the branch-and-bound procedure (Q1342946) (← links)
- Single facility scheduling with major and minor setups (Q1373896) (← links)
- An ant colony system for permutation flow-shop sequencing (Q1433172) (← links)
- Makespan minimization subject to flowtime optimality on identical parallel machines (Q1885968) (← links)
- Makespan minimization for two parallel machines with an availability constraint (Q1887910) (← links)
- Flow-shop scheduling with flexible processors (Q1891241) (← links)
- A tropical cyclone-based method for global optimization (Q2358848) (← links)
- Improved MILP models for two-machine flowshop with batch processing machines (Q2389826) (← links)
- Group scheduling on two cells with intercell movement (Q2563903) (← links)
- Parallel machine scheduling with preference of machines (Q3163231) (← links)
- Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions (Q3192848) (← links)
- An Algorithm for Minimizing the Range of Lateness on a Single Machine (Q3211100) (← links)
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q3527950) (← links)
- Stochastic inventory model with controllable lead time (Q3982024) (← links)
- An Improved Formulation for the Job-Shop Scheduling Problem (Q4016258) (← links)
- Optimal release time on a stochastic single machine (Q4021544) (← links)
- Minimizing the Number of Machine Idle Intervals with Minimum Makespan in a Flow-Shop (Q4273245) (← links)
- Minimizing the Range of Order Completion Times with Multiple Job Classes (Q4273304) (← links)
- An efficient integer programming model of the dynamic lot-sizing problem (Q4298947) (← links)
- Survey of scheduling research involving setup times (Q4546846) (← links)
- The dynamic lot-sizing problem with variable unit costs (Q4851980) (← links)
- Optimal scheduling of products with common and unique components (Q4883817) (← links)
- Sequencing with setup time and order tardiness trade-offs (Q5689648) (← links)
