We consider coordination mechanisms for the distributed scheduling of n jobs on m parallel machines, where each agent holding a job selects a machine to process his/her own job. Without a central authority to construct a schedule, each agent acts selfishly to minimize his/her own disutility,...

We consider the m-machine ordered flow shop scheduling problem with machines subject to maintenance and with the makespan as objective. It is assumed that the maintenances are scheduled in advance and that the jobs are resumable. We consider permutation schedules and show that the problem is...

We consider the problem of scheduling a set of n jobs with arbitrary job sizes on a set of m identical and parallel batch machines so as to minimize the makespan. Motivated by the computational complexity of the problem, we propose a meta-heuristic based on the max–min ant system method....

This paper studies a two-machine flow shop scheduling problem with a supporting precedence relation. The model originates from a real production context of a chemical factory that produces foam-rubber products. We extend the traditional two-machine flow shop by dividing the operations into two...

Traditional Ecological Knowledge (TEK) is one of the components of the Globally Important Agricultural Heritage Systems (GIAHS), which are good examples of evolutionary adapted socio-ecosystems in human history. The Hani Rice Terraces System, located in China’s southwestern Yunnan Province, is...

We consider online scheduling of unit length jobs on m identical parallel-batch machines. Jobs arrive over time. The objective is to minimize maximum flow-time, with the flow-time of a job being the difference of its completion time and its release time. A parallel-batch machine can handle up to...

In many statistical analysis methods, standardization of the sample data is usually recommended to prevent the results from being strongly affected by the scale of measurement of the variables. This paper focuses on the standardization of interval data obtained by symbolic data analysis (SDA)....

In this paper, we consider the rescheduling problem for jobs on a single machine with release dates to minimize total sequence disruption under a limit on the makespan. We show that the considered problem can be solved in polynomial time. Consequently, the rescheduling problem for jobs on a...

This paper provides a comprehensive review of ecosystem services and their economic valuation in China. The main objective of this review is to introduce the findings of the various valuation studies, and explore the challenges that emerged in these studies. This paper shows that ecosystem...