Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime

No abstract is available for this paper.

• Publication year

  1997

• Venue

  Operational Research

• Publication date

  1997-12-01

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1287/opre.45.6.874
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Scheduling with batching: minimizing the weighted number of tardy jobs

  1994cited by this paper
• The Complexity of One-Machine Batching Problems

  1993cited by this paper
• Minimizing total completion time on batch processing machines

  1993influential reference
• Minimizing total completion time on a batch processing machine with job families

  1993cited by this paper
• A polynomial algorithm for a one machine batching problem

  1992cited by this paper
• Batching and Scheduling Jobs on Batch and Discrete Processors

  1992influential reference
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

  1992cited by this paper
• A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNING

  1992cited by this paper
• A new dynamic programming algorithm for the parallel machines total weighted completion time problem

  1992cited by this paper
• Batch sizing and job sequencing on a single machine

  1991cited by this paper
• Dynamic batching heuristic for simultaneous processing

  1991cited by this paper
• Scheduling problems in connection with flexible production systems

  1991cited by this paper
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine

  1989cited by this paper
• One-pass batching algorithms for the one-machine problem

  1988cited by this paper
• Batching to minimize flow times on one machine

  1987cited by this paper
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem

  1986cited by this paper
• Efficient scheduling algorithms for a single batch processing machine

  1986cited by this paper
• Scheduling independent tasks to reduce mean finishing time

  1974cited by this paper
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems

  1969cited by this paper
• Scheduling Independent Tasks on Parallel Processors

  1966cited by this paper

• HyDPN: A Hybrid Deep Reinforcement Learning, Programming, and Neighborhood Operations framework for integrated scheduling on parallel batch processing machines

  2026cites this paper
• Minimizing Makespan in Sublinear Time via Weighted Random Sampling

  2026cites this paper
• On the integration of reinforcement learning and simulated annealing for the parallel batch scheduling problem with setups

  2025cites this paper
• Submodular batch scheduling on parallel machines

  2024cites this paper
• The dry dock scheduling problem

  2024cites this paper
• Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs

  2023cites this paper
• STUDY OF RELATIONSHIPS BETWEEN

  2022cites this paper
• Online scheduling on parallel-batching machines with periodic availability constraints and job delivery

  2022cites this paper
• Study of Relationships Between Scheduling Objectives in Semiconductor Manufacturing

  2022cites this paper
• A solution-driven multilevel approach for graph coloring

  2021cites this paper
• Cooperative Supply Chain Scheduling

  2021cites this paper
• Parallel batch scheduling: Impact of increasing machine capacity

  2021cites this paper
• A survey of scheduling with parallel batch (p-batch) processing

  2021cites this paper
• A deep learning guided memetic framework for graph coloring problems

  2021cites this paper
• Reduction and Local Search for Weighted Graph Coloring Problem

  2020cites this paper
• Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines

  2020cites this paper
• Batch scheduling of nonidentical job sizes with minsum criteria

  2019influential citation
• Discrete-time queue with batch renewal input and random serving capacity rule: $$GI^X/ Geo^Y/1$$GIX/GeoY/1

  2019cites this paper
• Development of Smart Semiconductor Manufacturing: Operations Research and Data Science Perspectives

  2019cites this paper
• Mixed batch scheduling on identical machines

  2019cites this paper
• Adaptive feasible and infeasible tabu search for weighted vertex coloring

  2018cites this paper
• Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II

  2017influential citation
• Minimizing Total Completion Time of Batch Scheduling with Nonidentical Job Sizes

  2017cites this paper
• Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I

  2017influential citation
• Fast Scheduling of Semiconductor Manufacturing Facilities Using Case-Based Reasoning

  2016cites this paper
• Integrated production and delivery on parallel batching machines

  2015cites this paper
• A modified imperialist competitive algorithm for scheduling single batch-processing machine with fuzzy due date

  2015cites this paper
• Scheduling parallel-machine batch operations to maximize on-time delivery performance

  2015cites this paper
• Single-machine batch scheduling with job processing time compatibility

  2015cites this paper
• Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes

  2015cites this paper
• Single-machine parallel-batching scheduling with family jobs to minimize weighted number of tardy jobs

  2014cites this paper
• Scheduling a Bounded Parallel-Batching Machine with Incompatible Job Families and Rejection

  2014cites this paper
• Online bounded-batch scheduling to minimize total weighted completion time on parallel machines

  2014cites this paper
• Scheduling a Bounded Parallel-Batching Machine with Incompatible Job Families and Rejection

  2014cites this paper
• A survey of two-dimensional scheduling

  2014cites this paper
• Model approximation for batch flow shop scheduling with fixed batch sizes

  2014cites this paper
• Minimization of Total Processing Time in Semiconductor Photolithography Process

  2013cites this paper
• Batch scheduling problem for a machinery factory with fixed-position layout

  2013cites this paper
• Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries

  2013cites this paper
• Two-Dimensional Scheduling: A Review

  2013cites this paper
• A rule-based simulation approach to scheduling problem in semiconductor photolithography process

  2013cites this paper
• Bi-objective dynamic control of batch processor with non-identical jobs in mould manufacturing

  2013cites this paper
• GRASP to minimize makespan for a capacitated batch-processing machine

  2013cites this paper
• GRASP to minimize makespan for a capacitated batch-processing machine

  2013cites this paper
• Scheduling an unbounded batching machine with family jobs and setup times

  2012cites this paper
• Minimizing Makespan in Parallel Scheduling Problem with Deterioration using two Meta Heuristics

  2012cites this paper
• Analysis of finite-buffer state-dependent bulk queues

  2012cites this paper
• Scheduling unrelated parallel machines in semiconductor manufacturing by problem reduction and local search heuristics

  2012cites this paper
• Controlling the order pool in make-to-order production systems

  2012cites this paper
• Minimizing the total completion time in a two-machine flowshop with release times

  2012cites this paper
• Bounded parallel-batching scheduling with two competing agents

  2012cites this paper
• DOCTEUR DE L'UNIVERSITÉ DE GRENOBLE

  2012cites this paper
• Optimisation du chargement des laveurs dans un service de stérilisation

  2011cites this paper
• Unbounded parallel-batching scheduling with two competitive agents

  2011cites this paper
• An Improved Approximation Algorithm for a Class of Batch Scheduling Problems

  2011cites this paper
• Minimising makespan for single burn-in oven scheduling problems using ACO+DP approach

  2010cites this paper
• Two-Stage flowshop Scheduling Problems with Identical and Batch Processors

  2010cites this paper
• Approximation in Batch and

  2010cites this paper
• Minimize the Sum of Total Completion Time and Total Rejection Penalties on a Single Parallel Batching Machine

  2010cites this paper
• Capacitated Max-Batching with interval graph compatibilities

  2010cites this paper
• A Dynamic Scheduling Algorithm for Complex Product with Batching Machines

  2010cites this paper
• Customer order scheduling in parallel batching processors with splitting-merging procedure

  2010cites this paper
• Modeling and analysis of two unreliable batch machines with a finite buffer in between

  2010cites this paper
• Approximation in batch and multiprocessor scheduling

  2010cites this paper
• Scheduling Wafer Lots on Diffusion Machines in a Semiconductor Wafer Fabrication Facility

  2010cites this paper
• Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints

  2010cites this paper
• Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing

  2009cites this paper
• Minimizing weighted number of tardy jobs on unbounded single batching machine with family jobs

  2009cites this paper
• Cyclic transfer algorithm for single batching machine with total weighted completion time

  2009cites this paper
• The Vertex Coloring Problem and its generalizations

  2009cites this paper
• Fifty years of scheduling: a survey of milestones

  2009cites this paper
• Models and heuristic algorithms for a weighted vertex coloring problem

  2009cites this paper
• A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling

  2009cites this paper
• The coordination of transportation and batching scheduling

  2009cites this paper
• Scheduling a burn-in oven with non-agreeable release times and due dates

  2009cites this paper
• Heuristics to minimize makespan of parallel batch processing machines

  2008cites this paper
• Approximations with Improving Error Bounds for Makespan Minimization in Batch Manufacturing

  2008cites this paper
• Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework

  2008cites this paper
• Scheduling a single semi-continuous batching machine

  2008cites this paper
• Production Scheduling for a Two-machine Flow Shop with a Batch Processing Machine

  2008cites this paper
• Tabu Search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints

  2008cites this paper
• Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times

  2008cites this paper
• Scheduling with Batch Compatible Tasks

  2008cites this paper
• Scheduling a capacitated batch-processing machine to minimize makespan

  2007cites this paper
• Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date

  2007cites this paper
• Monotonically improving error bounds for a sequence of approximations for makespan minimization of batch manufacturing systems

  2007cites this paper
• Control of manufacturing systems with downstream batch processors

  2007cites this paper
• Topics in production

  2007cites this paper
• STOCHASTIC BATCH SCHEDULING AND THE “SMALLEST VARIANCE FIRST” RULE

  2007cites this paper
• Scheduling a Flexible Batching Machine

  2007cites this paper
• A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families

  2006influential citation
• A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem

  2006cites this paper
• A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor

  2006cites this paper
• Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms

  2006cites this paper
• Scheduling a Single Continuous Batch Processing Machine to Minimize Makespan

  2006cites this paper
• Scheduling a Single Continuous Batch Processing Machine to Minimize Makespan

  2006cites this paper
• Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes

  2006cites this paper
• Modeling and Performance Analysis of a Finite-Buffer Queue with Batch Arrivals, Batch Services, and Setup Times: The MX/GY/1/K + B Queue with Setup Times

  2006cites this paper
• Minimizing Total Weighted Completion Time on Identical Parallel Batch Machines

  2006cites this paper
• Minimizing earliness–tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint

  2006cites this paper