Learn More
The usual assessment of general mental ability (or intelligence) is based on performance attained in reasoning and problem-solving tasks. Differences in general mental ability have been associated with event-related neural activity patterns of the wakeful working brain or physical, chemical and electrical brain features measured during wakeful resting(More)
In this note we give an easier proof of the known result that the car sequencing problem is NP-hard, and point out that it is NP-hard in the strong sense. We show that a previous claim of NP-completeness is incorrect, and instead we give a sufficient condition of membership of NP. We also provide a pseudo-polynomial algorithm for a special case.
The hybrid or flexible flowshop problem is a generalization of the flowshop in such a way that every job can be processed by one among several machines on each machine stage. In recent years a number of effective exact methods have been developed. A major reason for this progress is the development of new job and machine based lower bounds as well as the(More)
Traditionally, scheduling research is concerned with the sequencing of tasks on one machine or on several parallel or different machines, subject to a set of constraints. Over the years, researchers have studied a huge variety of problems, developing numerous heuristics, approximation and exact algorithms, and complexity results. Some of these problems are(More)
The principal challenge of inventory control in supply chains is that the interacting autonomous enterprises have to plan their production and logistics under information asymmetry, driven by different, often conflicting objectives. In this paper, four different computational approaches are investigated to cope with this challenge: decomposition,(More)