The following pages link to Chin-Chia Wu (Q298498):
Displaying 45 items.
- Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs (Q298499) (← links)
- A tabu method for a two-agent single-machine scheduling with deterioration jobs (Q336450) (← links)
- An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
- An order scheduling problem with position-based learning effect (Q342484) (← links)
- Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration (Q380458) (← links)
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties (Q454994) (← links)
- Four single-machine scheduling problems involving due date determination decisions (Q497630) (← links)
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (Q497951) (← links)
- A single-machine scheduling with a truncated linear deterioration and ready times (Q497952) (← links)
- Two-agent scheduling with position-based deteriorating jobs and learning effects (Q546060) (← links)
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times (Q622157) (← links)
- A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function (Q693656) (← links)
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times (Q782088) (← links)
- Note on a single-machine scheduling problem with sum of processing times based learning and ready times (Q1665710) (← links)
- A two-agent single-machine scheduling problem to minimize the total cost with release dates (Q1701559) (← links)
- A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
- A two-machine flowshop scheduling problem with precedence constraint on two jobs (Q1701710) (← links)
- Metaheuristics for order scheduling problem with unequal ready times (Q1727107) (← links)
- The single-machine total weighted tardiness scheduling problem with position-based learning effects (Q1762088) (← links)
- Re-entrant flowshop scheduling with learning considerations to minimize the makespan (Q1787748) (← links)
- Single-machine scheduling problems with a learning effect matrix (Q1787789) (← links)
- Single-machine common due window assignment and scheduling to minimize the total cost (Q1941535) (← links)
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times (Q2009966) (← links)
- Two-agent integrated scheduling of production and distribution operations with fixed departure times (Q2076366) (← links)
- Rescheduling problems with allowing for the unexpected new jobs arrival (Q2125233) (← links)
- Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect (Q2152905) (← links)
- Two-agent single-machine scheduling with assignable due dates (Q2250186) (← links)
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
- Single-machine scheduling and due date assignment with rejection and position-dependent processing times (Q2438395) (← links)
- The single-machine total tardiness problem with unequal release times and a linear deterioration (Q2511712) (← links)
- Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents (Q3120079) (← links)
- Single-machine batch scheduling problem with job rejection and resource dependent processing times (Q4553872) (← links)
- Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work (Q4632917) (← links)
- <i>CON</i>/<i>SLK</i> due date assignment and scheduling on a single machine with two agents (Q4632940) (← links)
- A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion (Q4689397) (← links)
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (Q5058765) (← links)
- A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration (Q5059372) (← links)
- Parallel-Machine Scheduling to Minimize Flowtime, Holding, and Batch Delivery Costs (Q5174414) (← links)
- Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration (Q5174416) (← links)
- A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing (Q5506759) (← links)
- Sequencing single machine multiple-class customer order jobs using heuristics and improved simulated annealing algorithms (Q6050604) (← links)
- Metaheuristics for two-stage flow-shop assembly problem with a truncation learning function (Q6094327) (← links)
- Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates (Q6094571) (← links)
- Wasserstein distributionally robust chance-constrained program with moment information (Q6164346) (← links)
