Search results

Das urbane Dilemma: den staatlichen Bestrebungen, den städtischen Raum sicherer zu machen, steht das Prinzip gegenüber, dass Städte ein Raum einer offenen Zivilgesellschaft und Demokratie mit Meinungs- und Versammlungsfreiheit sind. Wie lassen sich beide Interessen in eine Balance bringen?Ausgehend von der viel diskutierten Sanierung des Regierungsviertels in Oslo nach den Anschlägen von 2011, bietet das Buch eine breite Diskussionsplattform für die unterschiedlichen Positionen an der Schnittstelle zwischen Architektur/Urbanismus und Sicherheit/Demokratie. Interviews, Grafiken und Fotoessays dokumentieren Studien in UK, USA, Israel, Palestina und Spanien. Mit Beiträgen von S. Graham, M. Sorkin, D.Harvey, G. Agamben, Y. Yasky, L. Lambert, CPNI, R. V. Clarke, J. Coaffee and O. Newman.

Knowledge can influence the whole decision-making process of consumers. While green product knowledge is often conceptualized as a direct antecedent of green purchase intention, empirical findings in support of this relationship are inconsistent. Based on 236 samples, this study investigates how green product knowledge promotes consumers&rsquo ; green purchase intention. Results show that green trust and perceived consumer effectiveness partly mediate the relationship between green product knowledge and green purchase intention. The relationship between green trust and green purchase intention is positively moderated by perceived price. Compared with low perceived price, green trust has a greater effect on green purchase intention in the case of high perceived price. However, the relationship between perceived consumer effectiveness and green purchase intention is not moderated by perceived price. This study provides a new insight into green product knowledge and how to promote green purchase intention, and the findings help government and enterprises to formulate strategies to promote consumers&rsquo ; green purchase intention.

AbstractWe consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.

AbstractIn this article, we study bicriterion Pareto‐scheduling on a single machine of equal‐length jobs, where one of the criteria is the total weighted late work. Motivated by two Pareto‐scheduling open problems where one criterion is the total (weighted) late work and the other criterion is the weighted number of tardy jobs, we show that 12 constrained scheduling problems unaddressed in the literature are binary ‐hard, implying that the Pareto‐scheduling versions of these problems are also binary ‐hard. Moreover, we introduce the concept of dummy due dates (DDD) for equal‐length jobs to be scheduled in equal‐length intervals. Intriguingly, we find that a DDD‐based technique outperforms the existing solution methods and improves the known time complexities of the related problems. In addition, we extend our research to the two‐agent scheduling model under the assumption of equal‐length or partially equal‐length jobs by including the total weighted late work as the criterion of one agent. For these problems, our results also improve the known time complexity results.