Abstract Environmental pollution is one of the major challenges in China, which seriously affects people's life, economy and society. This paper proposes a multi‐criteria group decision‐making method based on hesitant fuzzy preference relations with self‐confidence (HFPRs‐SC) behaviours and applies it to the evaluation of the environmental pollution emergency response process. Firstly, a comprehensive evaluation system is proposed that covers the environmental pollution emergency response process. Moreover, is utilized to obtain the normalized hesitant fuzzy preference relationship, and an algorithm that considers both the hesitant fuzzy preference value and the self‐confidence level is proposed to improve the consistency of HFPRs‐SC. In addition, combined with subjective and objective weights of experts, a weighted average operator based on the confidence level is applied to aggregate individual HFPR‐SC. Furthermore, the score function of HFPRs‐SC is designed to get the best ranking. Finally, a case study on an explosion accident in Fujian Province of China is conducted to verify the practicability and effectiveness of the proposed method with comparative analysis and sensitivity analysis. Based on the analysis, some suggestions are put forward for improving environmental pollution emergency response.

3-D, and in particular stereoscopic, displays are believed to have great prospects. Due to imperfections in the optical and electronic components, however, some image distortions still exist in these displays. Among them, crosstalk is considered to be a very annoying one. The aim of the current research is to investigate crosstalk perception and its influence on image quality when rendering dynamic image sequences on two types of stereoscopic displays: a hold-type liquid-crystal display with patterned retarder and circular polarizing glasses, and an impulse-type digital light processing display with shutter glasses. Results show that the dynamic behavior of the displays has an impact on crosstalk perception. Perceived motion blur can mask crosstalk visibility, especially at low binocular parallax, which limits the crosstalk-induced image quality degradation.

As more and more companies are relying on their suppliers to provide raw materials or component parts, effective coordination and inventory management of supply chain members became critical issues. Various methods including information sharing and postponing strategy have been explored to improve supply chain performance. However, questions regarding what information to share and the benefits under different conditions for different members are not fully understood. This paper presents a simulation study on a three-level infinite capacity supply chain through a systematic design of experiments. Independent variables include lead times, information sharing patterns, demand uncertainties, and service levels. It is shown through the analysis of means and the analysis of variance that one-way full information sharing is sufficient to achieve good performance. The types of benefit received by different members, however, are different. Furthermore, as more information is shared, the benefit from postponing customization decreases.

In view of today's "time-based competition," scheduling manufacturing operations using the most advanced scheduling tools has become a crucial issue for manufacturers. This can be achieved by using an Internet-based scheduling system. The main considerations in designing such a system are how to provide an effective scheduling tool without major investment, and how to ensure fast and easy access for manufacturers who have diversified computational platforms and settings. This paper presents such an Internet-based scheduling system that meets these considerations. The system is a novel combination of judiciously selected components with several architectural design options, and delivers high quality scheduling solutions in a reasonable computational time via a user friendly and secure Internet environment. The testing results are compared for different implementations of scheduling systems and results for problems of different sizes are provided.