在高校数学教育中应用数学案例教学的研究与实践

案例教学法是以案例为媒介的一种启发式教学方法。案例教学在数学教学中有重要作用，它有助于丰富和加深学生对数学理论知识的理解，把握好数学案例教学方法，对于培养和锻炼学生的分析解决实际问题的能力有着积极作用。     

Scheduling parallel machines with inclusive processing set restrictions and job rejection

In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017     

关于计量经济学案例教学的探讨

计量经济学包含理论教学、实验教学、案例教学三个教学环节,案例教学作为联系理论教学与实验教学的桥梁与纽带,在计量经济学教学中起着重要的作用。但目前计量经济学案例教学仍存在对案例教学法认识不够、案例资源匮乏、案例选择使用不当等问题。针对这些问题,本文提出了正确处理理论教学与案例教学关系、编撰经典案例集、准确选择使用案例等一些具体的改革措施与建议,以提高计量经济学教学效果。     

案例教学法在消费心理学课程中的运用与研究

《消费心理学》是一门应用性较强的学科,为提高教学效果,在课程中运用案例教学法是十分必要的。本文介绍了怎样在《消费心理学》课程中运用案例教学的策略,并分析了该课程实施案例教学的效果以及应注意的问题。     

试论案例教学法在高校应用文写作教学中的运用

高校应用文写作传统教学模式教学效果不尽如人意,将案例引人到应用文写作教学中,则可以极大提高教学效率,激发学生学习兴趣、培养其分析能力,真正训练学生的应用文写作能力;案例教学法在高校应用文写作教学实践中的有效运用关键要把握好案例选择、案例的分析与讨论、案例的写作与修改三个主要环节;教学实践表明这是一种符合高校应用文写作教学规律的有效模式。     

案例教学在《化学事故应急救援》课程中的应用

案例教学首先要了解“案例教学法”的含义及特点,在此基础上介绍《化学事故应急救援》的课程特点,并就该课程案例教学实施过程中案例的选取、课堂案例讨论、案例总结与评价等问题进行分析,最后对案例教学实施中应注意的问题提出三点意见。     

论贩毒案件的侦查方法

贩毒案件在各种毒品犯罪案件中居主导地位,公安机关非常重视对贩毒案件的侦查。通过对贩毒案件特点的分析,阐述了贩毒案件的侦查方法。     

新课程理念下数学探究教学的理论与实践探索

数学探究教学作为新课程标准倡导的一种教学模式,它注重学生的参与体验,强调在教师的指导和点拨下展开具有探究性和一定创造性的教学活动。探究教学是发展学生个体,培养学生能力,提高学生素质的重要途径。另外,有关探究教学案例的开发也是不容忽视的一个重要方面。     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

Case‐based reasoning and improved adaptive search for project scheduling

Most scheduling problems are notoriously intractable, so the majority of algorithms for them are heuristic in nature. Priority rule‐based methods still constitute the most important class of these heuristics. Of these, in turn, parametrized biased random sampling methods have attracted particular interest, due to the fact that they outperform all other priority rule‐based methods known. Yet, even the “best” such algorithms are unable to relate to the full range of instances of a problem: Usually there will exist instances on which other algorithms do better. We maintain that asking for the one best algorithm for a problem may be asking too much. The recently proposed concept of control schemes, which refers to algorithmic schemes allowing to steer parametrized algorithms, opens up ways to refine existing algorithms in this regard and improve their effectiveness considerably. We extend this approach by integrating heuristics and case‐based reasoning (CBR), an approach that has been successfully used in artificial intelligence applications. Using the resource‐constrained project scheduling problem as a vehicle, we describe how to devise such a CBR system, systematically analyzing the effect of several criteria on algorithmic performance. Extensive computational results validate the efficacy of our approach and reveal a performance similar or close to state‐of‐the‐art heuristics. In addition, the analysis undertaken provides new insight into the behaviour of a wide class of scheduling heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 201–222, 2000