Algorithms for scheduling parallel batch processing machines with non-identical job ready times

This research is motivated by a practical application observed at a printed circuit board (PCB) manufacturing facility. After assembly, the PCBs (or jobs) are tested in environmental stress screening (ESS) chambers (or batch processing machines) to detect early failures. Several PCBs can be simultaneously tested as long as the total size of all the PCBs in the batch does not violate the chamber capacity. PCBs from different production lines arrive dynamically to a queue in front of a set of identical ESS chambers, where they are grouped into batches for testing. Each line delivers PCBs that vary in size and require different testing (or processing) times. Once a batch is formed, its processing time is the longest processing time among the PCBs in the batch, and its ready time is given by the PCB arriving last to the batch. ESS chambers are expensive and a bottleneck. Consequently, its makespan has to be minimized. ^ A mixed-integer formulation is proposed for the problem under study and compared to a formulation recently published. The proposed formulation is better in terms of the number of decision variables, linear constraints and run time. A procedure to compute the lower bound is proposed. For sparse problems (i.e. when job ready times are dispersed widely), the lower bounds are close to optimum. ^ The problem under study is NP-hard. Consequently, five heuristics, two metaheuristics (i.e. simulated annealing (SA) and greedy randomized adaptive search procedure (GRASP)), and a decomposition approach (i.e. column generation) are proposed—especially to solve problem instances which require prohibitively long run times when a commercial solver is used. Extensive experimental study was conducted to evaluate the different solution approaches based on the solution quality and run time. ^ The decomposition approach improved the lower bounds (or linear relaxation solution) of the mixed-integer formulation. At least one of the proposed heuristic outperforms the Modified Delay heuristic from the literature. For sparse problems, almost all the heuristics report a solution close to optimum. GRASP outperforms SA at a higher computational cost. The proposed approaches are viable to implement as the run time is very short. ^

Future Seniors: Is the Hospitality Industry Ready for Them?

Persons age 55 and over will become the biggest market for hospitality throughout the next 30 years. This future senior market will not have the same needs and characteristics of current seniors. The author discusses the similarities and differences of the current and future senior markets and offers recommendations for meeting the needs of the future senior market.

Are Consumers Ready for Mobile Payment? An Examination of Consumer Acceptance of Mobile Payment Technology in Restaurant Industry

As an emerging payment method, mobile payment technology is perceived to be a secure and effective substitute of traditional debit/credit card payment. Although several reports and scholars claimed that mobile payment technology would become a major future payment method, consumers rather caught on this trend slowly, and little is known about key determinants of consumers’ acceptance of mobile payment. To close that gap, the current study extended the classic Technology Acceptance Model by adding four additional predictors that are relevant to hospitality industry. The study results suggested that compatibility with lifestyle was the strongest predictor of consumers’ intention to adopt mobile payment technology in restaurants, followed by perceived usefulness, subjective norm, security, and previous experience with mobile payment. Important theoretical and practical implications were provided based on our findings.